Sort by: date | rating

Servers | Dragongoserver | The longest game


   
   
2009-02-22 Expert: Robert M Gogo Rate: (2)  5 ratings

The longest game


On DGS, there was an attempt to play the longest Go game ever. It was supposed to be played over many generations. I believe that other servers cannot beat Dragon in a suitability for this kind of an attempt  :)  Unfortunately, it ended only after one year...

The game was on 25x25 board with Fischer time: 365 days and 365 days extra per move.

How long could possibly this game last?

Please post your answers below.


Source:  www.dragongoserver.net,  game  157629




Comments:

Jhonnie
2018-01-26 05:01
Michael and Robert, are you so retarded that you do not know about the ko rule
Michael Redmond
9P ( US ) 2014-05-04 12:05
I agree with Adrian Petrescu. That game would be considered legal. However, black would run out of stones before we even get to step 3 XD
Robert M Gogo
( US ) 2009-02-23 05:02
> I'm pretty sure that DGS doesn't implement 3-way move repetition detection.
Good point.

> total positions it would have to hash ... would be many orders of magnitude larger than the hard drives of the servers ...
It only needs to keep the game record. All the positions can be recreated form it. But the question of making an efficient algorithm for checking is interesting. One can, for example, use the number of black and white stones, which will scale down the need for checking positions a lot.

Would the hard drive space still be many orders of magnitude larger than the space the DGS servers will have at the time when the moves will be played?

Now, assuming the super-ko rule is implemented, would the game go forever?
If not how long could it last?

> just consider the following game ...
Great idea. How long would this game last?

> I doubt you were looking for a purely theoretical answer...
In fact, I was looking for any interesting answer, including a purely theoretical one.
Adrian Petrescu
1d ( CA ) 2009-02-23 01:02
I'm pretty sure that DGS doesn't implement 3-way move repetition detection. Even if it did, the number of total positions it would have to hash in order to never repeat the same position would be many orders of magnitude larger than the hard drives of the servers on which it runs.

Therefore the game could go on forever. If you don't believe me, just consider the following game:

1) Black plays anywhere
2) White passes
3) Repeat 1) and 2) until the whole board is one giant black group with a single eye
4) White captures the Black group
5) Black passes
6) Go to step 1), but with the colors reversed

An infinite go-playing program! ;) Of course I doubt you were looking for a purely theoretical answer...


Post new comment:

Name: *
No spam!
How to eat this stone?*
 No spam! How to eat this stone?
(For example: C3)
Rank:
Country:
Comment: *
   Partners
   Partners
Copyright (c) 2008-2009 GoSensations.com - All Rights Reserved
Web Go Rating -
Top361.com