MTD(f) Engines
Posted: 25 Nov 2009, 04:16
Hello, I am studying MTD chess algorithms and testing them as part of my Masters Dissertation.
I have currently modified Crafty 23.0 to use MTD(f). I still have to modify the transposition table to store both upper and lower bounds. When testing with 500, 1 second games, the MTD(f) Crafty version is able to score around 45%. This is a little bit lower than I expected. Perhaps, I have made some coding errors.
My question is this...Are there any strong present day chess engines which use MTD(f)? I seems that all the present engines today use PVS/Negascout. This makes sense as there are several state of the art open source implementations of PVS/Negascout engines, such as Crafty or Fruit which can aid programmers in learning how to implement various parts of the chess engine to work in harmony with the PVS\Negascout search.
Eric Stock
Author of MagnumChess
I have currently modified Crafty 23.0 to use MTD(f). I still have to modify the transposition table to store both upper and lower bounds. When testing with 500, 1 second games, the MTD(f) Crafty version is able to score around 45%. This is a little bit lower than I expected. Perhaps, I have made some coding errors.
My question is this...Are there any strong present day chess engines which use MTD(f)? I seems that all the present engines today use PVS/Negascout. This makes sense as there are several state of the art open source implementations of PVS/Negascout engines, such as Crafty or Fruit which can aid programmers in learning how to implement various parts of the chess engine to work in harmony with the PVS\Negascout search.
Eric Stock
Author of MagnumChess