Difference between revisions of "Chess Move Generator"
| Line 1: | Line 1: | ||
| − | In search algorithm, a good move ordering enables us to reduct size of search tree therefore search algorithm go deeper in the same time. | + | In search algorithm, a good move ordering enables us to reduct size of search tree therefore search algorithm go deeper in the same time. A good chess move ordering schema can be: |
* checking moves, direct and discovered, | * checking moves, direct and discovered, | ||
Revision as of 12:11, 18 October 2006
In search algorithm, a good move ordering enables us to reduct size of search tree therefore search algorithm go deeper in the same time. A 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).