[Computer-go] Combinatorics of Go

[Erik van der Werf]

On Mon, Jan 3, 2011 at 12:22 PM, Robert Jasiek <jasiek at snafu.de> wrote:
> On 03.01.2011 12:11, 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)

Best,
Erik