Author: Uri Blass
Date: 01:28:22 11/13/00
Go up one level in this thread
On November 13, 2000 at 02:46:37, Jeremiah Penery wrote: <snipped> >I think I remember someone talking >about implementing something like this (Hossa, IIRC) some time back. I remember that he was talking about evaluating fortress positions when it is impossible to do progress but he did not use it in practical games because of the problem that it is impossible to use hash tables in a normal way. He tried to use scores of previous positions in order to evaluate the leaves but in this case 2 identical positions in the tree can get different scores. It means that you can use hash tables only for better ordering of moves and not for getting the score when you get the same position. Uri
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.