Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

That would be quite a strange function. For example, Tic-Tac-Toe has 26830 possible games on 5478 possible positions, while 2x2 Go has 386356909593 possible games on only 57 possible positions.

The major difference of course being that Go allows stones to be captured.



I don't see what's strange about that, different functions grow at different rates. That's like saying it's strange that exp(x) is a billion for x = 21 while sqrt(x) is merely ~4 when x = 21.

Go's complexity grows much faster than tic tac toe's complexity as a function of legal positions, but the complexity is still a function of the number of legal positions (among other things, as I pointed out).




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: