[computer-go] .. if Monte-Carlo programs would play infinite strong

[Richard Brown]

aquarius at fantasymail.de

> Eeh, am I missing some point here or would not any Go program that uses search and infinite computer power "simply" SOLVE the game - given that scoring is done right and infinite loops are ruled out?

This is a common misconception.  The problem lies in that pesky word, "infinite".

Two inescapable facts prevent such a computer from ever existing:

	-  There are a finite number of atomic particles in the universe.

	-  The age of the universe is a finite length of time.

These facts mean that, even _if_ one were able to use each and every atomic particle as
a bit in one huge universe-sized computer, there would _never_ be sufficient room
to store the results of such a search, even _if_ one had infinite time!

And conversely, even _if_ there were an _infinite_ number of atomic particles in
the universe, permitting sufficient room to store the results, the calculation of
those results would take longer than the age of the universe, which is finite.

> If we had infinite computing power Go would resemble tic tac toe from a programmer's perspective. period.

You seem mighty certain about that.

If the moon were made of green cheese, I am the pope.  Period.

Hmmm, I guess you are right after all.

-- 
Rich