[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [John.Tromp@xxxxxxxxxxxxxxxxx: Re: computer-go: How many bits are needed to encode an N x N Go position?]

To: computer-go@xxxxxxxxxxxxxxxxx
Subject: Re: [John.Tromp@xxxxxxxxxxxxxxxxx: Re: computer-go: How many bits are needed to encode an N x N Go position?]
From: John Tromp <John.Tromp@xxxxxx>
Date: Sat, 19 Oct 2002 16:02:41 +0200
In-reply-to: <p05111708b9d629df6006@[136.152.196.167]>; from rden@xxxxxxxxxxxxxxxxx on Fri, Oct 18, 2002 at 02:20:01PM -0700
References: <200210181420.g9IEK1Q19845@xxxxxxxxxxxxxxxxx> <p05111708b9d629df6006@[136.152.196.167]>
Reply-to: computer-go@xxxxxxxxxxxxxxxxx
Sender: owner-computer-go@xxxxxxxxxxxxxxxxx
User-agent: Mutt/1.2.5.1i

> This is very interesting.  But I don't understand. What do you mean 
> by a superko rule and why is it necessary?

without a superko rule, games on small boards easily lead to infinite cycles,
e.g. try a 2x2 game without any passes...

-john

References:
- [John.Tromp@xxxxxxxxxxxxxxxxx: Re: computer-go: How many bits are needed to encode an N x N Go position?]
  - From: Don Dailey
- Re: [John.Tromp@xxxxxxxxxxxxxxxxx: Re: computer-go: How many bits are neededto encode an N x N Go position?]
  - From: Robert de Neufville

Prev by Date: computer-go: new topics
Next by Date: Re: computer-go: new topics
Previous by thread: Re: [John.Tromp@xxxxxxxxxxxxxxxxx: Re: computer-go: How many bits are neededto encode an N x N Go position?]
Next by thread: Re: computer-go: Leibniz
Index(es):
- Date
- Thread