Move Representation

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.