Difference between revisions of "Chess Move Generator"
| (21 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | In search algorithm, a good move ordering | + | 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]]). | |
| − | * capturing moves | ||
| − | * non-capturing moves | ||
| − | MVV/LVA | + | 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). |
| + | == Links == | ||
| + | * [http://www.gamedev.net/reference/articles/article1126.asp Chess Programming Part III: Move Generation] | ||
| + | |||
| + | [[Category:Borko Bošković]] | ||
| + | [[Category:Research activity]] | ||
[[Category:Chess program BBChess]] | [[Category:Chess program BBChess]] | ||
| − | [[Category: | + | [[Category:Representation of Chess Game]] |
| + | |||
| + | [[sl:Generator potez]] | ||
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).