Difference between revisions of "Chess Move Generator"
| Line 1: | Line 1: | ||
In search algorithm, a good move ordering enables us to reduce the size of search tree so that search algorithm goes deeper. A good chess move ordering schema can be: | In search algorithm, a good move ordering enables us to reduce the size of search tree so that search algorithm goes deeper. A good chess move ordering schema can be: | ||
| − | |||
| − | |||
* capturing moves (MVV/LVA), | * capturing moves (MVV/LVA), | ||
* non-capturing moves ([[History heuristic]]). | * non-capturing moves ([[History heuristic]]). | ||
Latest revision as of 09:47, 6 December 2006
In search algorithm, a good move ordering enables us to reduce the size of search tree so that search algorithm goes deeper. A good chess move ordering schema can be:
- capturing moves (MVV/LVA),
- non-capturing moves (History heuristic).
The general idea of MVV/LVA is to first generate capture moves with the most valuable capture pieces and least valuable attacker pieces (e.g. pawn captures queen).