PathDependency

Home * Search * Path-Dependency

Path-Dependency describes a situation when the same position gets a different value depending on a sequence of moves by which it has been reached. Whilst a few programs do this by design [1], within the standard alpha-beta framework path-dependency is considered undesirable, if impossible to avoid.

See also#

• Graph History Interaction (GHI)
• Transposition
• Transposition Table
• Repetitions
• Fifty-move Rule

Forum Posts#

2000 …#

• “Don’t trust draw score” <=Is it true? by Teerapong Tovirat, CCC, August 08, 2001 » Repetitions, Graph History Interaction

2005 …#

• path dependent evaluation by Daniel Shawul, Winboard Forum, April 20, 2005
• Re: And a still unsolved test position by Uri Blass, CCC, June 09, 2005 » Movei
• Semi-Path Dependent Hashing: a semi-useless idea by Zach Wegner, CCC, May 24, 2008 » Transposition Table

2010 …#

• Repetitions/50 moves and TT by Sergei Markoff, CCC, September 13, 2011
• Texel recipe to fix TT draws scores by Marco Costalba, CCC, June 23, 2012 » Texel

External Links#

• Path dependence from Wikipedia

References#

1. ↑ Re: Methods to stably evaluate nodes? by Uri Blass, CCC, May 05, 2007
2. ↑ Tony Warnock, Burton Wendroff (1988). Search Tables in Computer Chess. ICCA Journal, Vol. 11, No. 1, pp. 10-13.

Up one Level