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

[steve uurtamo]

> To be quite honest, I have only a vague
> understanding of what is
> called "computational complexity" -- but it's clear
> enough that,
> _even_given_an_infinite_amount_of_storage_ it would
> take longer
> than the age of the universe to exhaustively search
> the game tree,
> and it is equally clear that,
> _even_given_infinite_time_ it would
> take more bits than there are particles in the
> universe.

and if it turns out that the game of go can be
equally well represented by a simpler structure
that we can finitely search in reasonable time,
then it will matter that we have considered this.

s.


 
____________________________________________________________________________________
Sponsored Link

Mortgage rates near 39yr lows. 
$420k for $1,399/mo. Calculate new payment! 
www.LowerMyBills.com/lre