Re: [computer-go] Ko and transposition tables

["Antoine de Maricourt" <antoine.de-maricourt@xxxxxxx>]

Have a look at the thesis Correct and Efficient Search Algorithms in the 
Presence of Repetitions by Akihiro Kishimoto (available at the computer go 
bibliography page).

   Antoine

----- Original Message ----- 
From: "Peter Drake" <drake@xxxxxxxxxxxxxxxxx>
To: <computer-go@xxxxxxxxxxxxxxxxx>
Sent: Tuesday, May 10, 2005 7:48 PM
Subject: [computer-go] Ko and transposition tables


> I'd like to add a transposition table to my tactical searcher.  Two 
> problems spring to mind:
>
> 1) If a position is re-encountered at a shallower search depth, the 
> cached value should not be used.  This is easily remedied by  maintaining 
> a depth for each cached value.
>
> 2) Because of ko, it matters how a particular position was reached.   I 
> could deal with this by keeping track of the path to each position,  but 
> this would make the transposition table almost worthless.  What  is 
> standard practice here?
>
> I thought I'd seen a paper on this topic, but I can't find it in the 
> Online Computer Go Bibliography.
>
> Peter Drake
> Assistant Professor of Computer Science
> Lewis & Clark College
> http://www.lclark.edu/~drake/
>
> _______________________________________________
> computer-go mailing list
> computer-go@xxxxxxxxxxxxxxxxx
> http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/