[Computer-go] Combinatorics of Go

[Robert Jasiek]

On 03.01.2011 12:33, Erik van der Werf wrote:
>>> "Under Japanese style ko rules, the long-term history is never needed
>>> to infer the best move".
>> Do you mean long>2 or long>cycle_length?
>
> Roughly speaking 'long>2'; to be more precise these are the extra
> state properties I typically use in my solver:
>
> - player to move
> - basic ko
> - number of consecutive passes
> - last play was basic ko capture (before passing started)
> - last two plays were basic ko captures '
> - number of Black/White captures
> - number of Black/White passes (not necessarily consecutive)


Now why may you say "never" in your conjecture?! To start with, please 
demonstrate how you handle
- sending-2-returning-1 cycle
- eternal life cycle
- 1-stone suicide cycle
- 2-stone suicide cycle

If you said "almost never", ok - but you insist on saying "never"!

-- 
robert jasiek