data structures term project checkers
Download
Skip this Video
Download Presentation
Data structures Term Project CHECKERS

Loading in 2 Seconds...

play fullscreen
1 / 8

Data structures Term Project CHECKERS - PowerPoint PPT Presentation


  • 120 Views
  • Uploaded on

Data structures Term Project CHECKERS. Group Member: Ayaz Ali Qureshi (BS-3) Omair Nasir (BS-7). Basic’s. Checker’s is a two-player board game. Each player has 12 pieces on the board initially. Either of the player has dark-colored pieces and the other one has light colored.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Data structures Term Project CHECKERS' - field


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
data structures term project checkers

Data structures Term ProjectCHECKERS

Group Member:

Ayaz Ali Qureshi(BS-3)

OmairNasir(BS-7)

basic s
Basic’s
  • Checker’s is a two-player board game.
  • Each player has 12 pieces on the board initially.
  • Either of the player has dark-colored pieces and the other one has light colored.
logic
Logic
  • We have used the basic logic of the game that a player can move diagonally to his right or left.
  • If a player has to move two places diagonally there must be opponents piece to his right or left.
moves
Moves
  • The game calculates the number of legal moves the computer can move.
  • The moves in which the piece can move two pieces diagonally is called a priority 1 move
  • The moves in which the piece can move only one piece diagonally is called a priority 0 move
move preference
Move Preference
  • If the set of moves contains a Priority 1 move it is carried out.
  • If the set of moves contains no Priority 1 moves then out of the Priority 0 moves is chosen randomly and moved.
ad