Difference between revisions of "Move Representation"
| Line 8: | Line 8: | ||
[[Category:Borko Bošković]] | [[Category:Borko Bošković]] | ||
| + | [[Category:Research activity]] | ||
[[Category:Chess program BBChess]] | [[Category:Chess program BBChess]] | ||
[[Category:Representation of Chess Game]] | [[Category:Representation of Chess Game]] | ||
[[sl:Bitna predstavitev potez]] | [[sl:Bitna predstavitev potez]] | ||
Latest revision as of 09:05, 19 October 2006
Moves have to be pithy and compact because in search algorithm we need to make moves and also store moves to use them later. A good schema for move representaton can be by a 16-bit integer value with following bit mask.
0000000000111111 - index of square from
0000001111000000 - promotion piece (optionally)
1111110000000000 - index of square to
First six bits are used for the description of source square, next four for promotion piece type and last six for destination square. Promotion piece type is optionaly.