Difference between revisions of "Chess Search Algorithms"
| (9 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | * [[ | + | Core of chess engines is search algorithm. Search algorithm with evaluation function evaluate search tree and chose "best" move. |
| + | |||
| + | * [[Min-Max Search]] | ||
* [[Alfa-Beta Search]] | * [[Alfa-Beta Search]] | ||
* [[Quiescent Search]] | * [[Quiescent Search]] | ||
* [[Iterative Deepening]] | * [[Iterative Deepening]] | ||
| − | * [[Aspiration Windows | + | * [[Aspiration Windows]] |
| + | * [[MTD(f)]] | ||
| + | * [[Transposition Table]] | ||
* [[Null Move Pruning]] | * [[Null Move Pruning]] | ||
| + | * [[Futility Pruning]] | ||
| + | |||
| + | [[Category:Borko Bošković]] | ||
| + | [[Category:Research activity]] | ||
| + | [[Category:Chess program BBChess]] | ||
| + | |||
| + | [[sl:Šahovski iskalni algoritmi]] | ||
Latest revision as of 09:57, 6 December 2006
Core of chess engines is search algorithm. Search algorithm with evaluation function evaluate search tree and chose "best" move.