Download
1 / 8
80 likes | 225 Views
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.
E N D
Data structures Term ProjectCHECKERS Group Member: Ayaz Ali Qureshi(BS-3) OmairNasir(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.
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 • 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 • 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.
