Re: RE: computer-go: 5x5 Go is solved?

[Jeffrey Rainy <JRainy@xxxxxxxxxxxx>]

>It does, thanks. You are using superko with a TT. This is a source of
>possible errors. Since a situation's value is defined by the entire move
>history, there is no easy way to ensure that a stored value in the TT can be
>reused. There was a "transpositions" thread about this last year
>(http://hamelin-zm.nom.fr/go-computer/mail10.html). No one had a fail-safe
>solution IIRC.

Did someone tried the same thing, with the following difference :
Always forbiding the maximizing player(black) from taking any Ko and always 
allowing the minimizing player to take any Ko ?

I don't think black can always win in these circumstances.  However, if a solution is 
found, playing by it will be allow to win in all rulesets ( maybe not with max score ). 
This could make a nice optimal 5x5 players independant of the ruleset.

If someone can show that black cannot win without taking a ko, or that there is a 
way for a ruleset to forbid a position in which black didn't take a ko, that would be 
interesting proofs.

J.