Difference between revisions of "Chess Move Generator"
| Line 4: | Line 4: | ||
* promotions, | * promotions, | ||
* capturing moves (MVV/LVA), | * capturing moves (MVV/LVA), | ||
| − | * non-capturing moves ([[History hevristic | + | * non-capturing moves ([[History hevristic]]). |
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). | 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). | ||
Revision as of 12:06, 18 October 2006
In search algorithm, a good move ordering enables us to reduct the tree sizes and search algorithm go deeper in the same time. An good chess move ordering schema can be:
- checking moves, direct and discovered,
- promotions,
- capturing moves (MVV/LVA),
- non-capturing moves (History hevristic).
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).