Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

[ANN] Advances in Go theory: announcing a new type of ko

10 views
Skip to first unread message

alex

unread,
Nov 30, 2009, 5:42:52 PM11/30/09
to
Ko being a thorny issue in Go rulesets, during my quest for the Holy
Grail in GoRulesLand I stumbled over a new type of ko, yet to be fully
explored: the Database Ko, a discovery which I wanted to share with
the expert community.

For details, see http://senseis.xmp.net/?DatabaseKo

-alex-

Ben Finney

unread,
Nov 30, 2009, 6:48:02 PM11/30/09
to
alex <alexander.d...@gmail.com> writes:

Perhaps surprisingly, this can be a problem in real-life play. In fact,
even fewer moves are sufficient to violate the Database Ko when no
computer is involved. When this occurs, though, often the resulting
effects cause misdiagnosis of the ko, which I suspect is why this type
of ko is not more widely acknowledged.

--
\ “My business is to teach my aspirations to conform themselves |
`\ to fact, not to try and make facts harmonise with my |
_o__) aspirations.“ —Thomas Henry Huxley, 1860-09-23 |
Ben Finney

Robert Jasiek

unread,
Dec 1, 2009, 2:03:34 AM12/1/09
to
This is not a new ko type, not even a new ko rules type. It is a
variant of my fixed game end rule construction to end the game on move
number x.
0 new messages