Difference between revisions of "Chess Move Generator"
| Line 9: | Line 9: | ||
== Links == | == Links == | ||
| − | [http://www.gamedev.net/reference/articles/article1126.asp Chess Programming Part III: Move Generation] | + | * [http://www.gamedev.net/reference/articles/article1126.asp Chess Programming Part III: Move Generation] |
[[Category:Borko Bošković]] | [[Category:Borko Bošković]] | ||
[[Category:Chess program BBChess]] | [[Category:Chess program BBChess]] | ||
Revision as of 11:17, 18 October 2006
In search algorithm, a good move ordering enables us to reduct the tree sizes and search faster. An good chess move ordering can be:
- checking moves, direct and discovered,
- promotions,
- capturing moves, ordered by most valuable victim / least valuable aggressor (MVV/LVA),
- non-capturing moves ordered according to history heuristic.
The general idea of MVV/LVA is to first generate capture moves with the most valuable capture piece and least valuable attacker piece (e.g. pawn captures queen).