Difference between revisions of "Position Representation"
| Line 1: | Line 1: | ||
The representation of a chess game includes representation of positions. 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: | The representation of a chess game includes representation of positions. 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 | * make move | ||
* unmake move | * unmake move | ||
| Line 11: | Line 12: | ||
* check role of 50 moves | * check role of 50 moves | ||
* check if king is in check | * 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. | 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. | ||
Revision as of 12:28, 3 October 2006
The representation of a chess game includes representation of positions. 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 role 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.