Author: Roman Hartmann
Date: 05:38:13 12/26/05
Hi all, recently I had an idea how to reach higher search depths (in the endgame or progressed middlegame) which keeps bugging me. Well, so far it's only and idea and I didn't even try to implement that so far (don't have hash in my engine yet) and maybe the idea isn't that new at all anyway as the tablebases are doing something similar in the endgame as well. The idea is to reverse the search tree. So after the ordinary search I start with a mate (or lets say with possible mating positions) and go backwards in the tree to see if I get a position that the ordinary search has already stored in the hash. If so I found a mate. Maybe that's not of much use in a chess engine but it might be worth a try in a mate searcher. The advantage is (or at least I'm under that impression) that two rather shallow trees are checked for identical positions rather than one much huger tree. Any comments on this? Roman
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.