Difference between revisions of "Graph History Interaction"

From Chessprogramming wiki
Jump to: navigation, search
Line 29: Line 29:
 
* [http://www.open-chess.org/viewtopic.php?f=5&t=2093 Aquarium IDEA, repetitions, and minimax over cycles] by  kevinfat, [[Computer Chess Forums|OpenChess Forum]], September 17, 2012 » [[Aquarium]]
 
* [http://www.open-chess.org/viewtopic.php?f=5&t=2093 Aquarium IDEA, repetitions, and minimax over cycles] by  kevinfat, [[Computer Chess Forums|OpenChess Forum]], September 17, 2012 » [[Aquarium]]
 
* [http://www.open-chess.org/viewtopic.php?f=5&t=2942 Another GHI example in SF (maybe)] by [[Mark Watkins|BB+]], [[Computer Chess Forums|OpenChess Forum]], December 30, 2015 » [[Stockfish]]
 
* [http://www.open-chess.org/viewtopic.php?f=5&t=2942 Another GHI example in SF (maybe)] by [[Mark Watkins|BB+]], [[Computer Chess Forums|OpenChess Forum]], December 30, 2015 » [[Stockfish]]
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=72578 Graph History Interaction 2 questions] by [[Jouni Uski]], [[CCC]], December 15, 2019 » [[Fifty-move Rule]]
  
 
=External Links=
 
=External Links=

Revision as of 08:27, 21 December 2019

Home * Search * Graph History Interaction

Graph History Interaction (GHI) is a general term related to the path-dependency in search algorithms. GHI occurs when the same game position behaves differently when reached via different paths.

See also

Selected Publications

Forum Posts

2000 ...

2010 ...

External Links

References

Up one Level