Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: [OT] Question about time allocation when limited moves available

Author: Dan Andersson

Date: 21:16:30 12/01/03

Go up one level in this thread


 There is an extended case of this problem. Sometimes you have n (most often n
equals two) possible moves that are functionally identical same since they by
force lead to a transposition to the same position. Detecting this case at the
root is problematic enough. Detecting it in the search at reasonable cost seems
even more troublesome.

MvH Dan Andersson



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.