[Computer-go] Combinatorics of Go

[Erik van der Werf]

On Mon, Jan 3, 2011 at 2:13 PM, Robert Jasiek <jasiek at snafu.de> wrote:
> On 03.01.2011 13:44, Erik van der Werf wrote:
>>
>> This is handled trivially by observing that one sided passes/captures
>> more in each cycle.
>
> How do you distinguish that from the opposing program passing as a tactical
> mistake (or as a "psychological" trick)?

If the opponent passes this knowledge becomes available by the small
finite list of extra features I described before.

BTW I don't see how one could play a "psychological" trick against a
program. I suppose the best one could hope for is to trigger a bug.


>> can work out the details.
>
> Easy: "almost never" is a better description.

The word 'almost' to me suggests that you would know for sure that
there exists an exception. I'm not convinced that is the case.

Erik