Difference between revisions of "Representation of Chess Game"
| Line 17: | Line 17: | ||
* [[Position Representation]] | * [[Position Representation]] | ||
* [[Move Representation]] | * [[Move Representation]] | ||
| + | * [[Position keys]] | ||
* [[Chess Move Generator]] | * [[Chess Move Generator]] | ||
Revision as of 08:26, 19 October 2006
The representation of a chess game includes representation of positions and moves. Positions represent states of game and moves represent operators which are used to achieve transition from one position to another. Both of these representations must be able to do the following operations:
- make move
- unmake move
- generate a list of all possible moves
- generate a list of all possible capture moves
- evaluate a position
- store moves
- compare positions
- set position
- check if position has been repeated 3 times
- check rule of 50 moves
- check if king is in check
All of these operations must be very time efficient because they take place inside the search algorithm. Efficient presentation of game will therefore exhibit an efficient chess program.