Difference between revisions of "Chess Search Algorithms"
| 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]] | * [[Min-Max Search]] | ||
* [[Alfa-Beta Search]] | * [[Alfa-Beta Search]] | ||
| Line 7: | Line 9: | ||
* [[Transposition Table]] | * [[Transposition Table]] | ||
* [[Null Move Pruning]] | * [[Null Move Pruning]] | ||
| + | * [[Futility Pruning]] | ||
[[Category:Borko Bošković]] | [[Category:Borko Bošković]] | ||
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.