Go has a problem with "game tree complexity snobbery"

General conversations about Go belong here.
RobertJasiek
Judan
Posts: 6273
Joined: Tue Apr 27, 2010 8:54 pm
GD Posts: 0
Been thanked: 797 times
Contact:

Re: Go has a problem with "game tree complexity snobbery"

Post by RobertJasiek »

illluck wrote:I suspect Robert also thinks it's silly to claim Go is objectively superior to Chess due to complexity


Complexity has several aspects. For some complexity aspects, Go is superior to Chess (among them: it requires more AI techniques to let a program beat a top player) - for others, the two games are equal. Complexity is just one of the topics that can make games interesting.
goTony
Lives in gote
Posts: 351
Joined: Tue Oct 22, 2013 12:22 am
Rank: OGS 11kyu
GD Posts: 0
KGS: gotony
OGS: nghtstalker
Location: Washington State
Has thanked: 272 times
Been thanked: 60 times
Contact:

Re: Go has a problem with "game tree complexity snobbery"

Post by goTony »

The number of first move possibilities is 361, but please keep in mind that most people do not play on the first line or second since it generally does not lead to a good outcome. So just quoting numbers does no good. Chess has 20 possible opening moves. But some are not used because of the weakness thereof. Both games have a complexity that dwarfs the human minds ability to fully grasp. And that is why we have GO and Chess tournaments and not tic tac toe....
Walla Walla GO Club -(on FB)

We play because we enjoy the beauty of the game, the snap and feel of real stones, and meeting interesting people. Hope to see ya there! お願いします!

Anthony
Javaness2
Gosei
Posts: 1545
Joined: Tue Jul 19, 2011 10:48 am
GD Posts: 0
Has thanked: 111 times
Been thanked: 322 times
Contact:

Re: Go has a problem with "game tree complexity snobbery"

Post by Javaness2 »

I think that the problem is now dead. It was the case that Go players would overstate this complexity aspect, lumping in the pants-on-a-stick ability of the state of the art software alongside. Such days are past.
Uberdude
Judan
Posts: 6727
Joined: Thu Nov 24, 2011 11:35 am
Rank: UK 4 dan
GD Posts: 0
KGS: Uberdude 4d
OGS: Uberdude 7d
Location: Cambridge, UK
Has thanked: 436 times
Been thanked: 3718 times

Re: Go has a problem with "game tree complexity snobbery"

Post by Uberdude »

Something which narked me slightly in all the AlphaGo press was the "Go is so complex, there are more games than atoms in the universe" spiel. I seem to recall Demis Hassabis said this in his presentations as well as being reported in newspaper/website articles. That atoms in the (observable) universe number is about 10^80, which is less than chess complexity (about 10^120) so it's rather a naff comparison. If every atom in the universe was replaced with a copy of the universe, and then every atom in those copies was replaced with another copy of the universe and then every atom in those copies of copies was replaced with a copy of the universe and you then counted all the atoms in those 4 levels of universes, then you'd have about 10^360 atoms which is Go's complexity. Exponentiation makes big numbers!
User avatar
EdLee
Honinbo
Posts: 8859
Joined: Sat Apr 24, 2010 6:49 pm
GD Posts: 312
Location: Santa Barbara, CA
Has thanked: 349 times
Been thanked: 2070 times

Post by EdLee »

  • There are more Go games than atoms in the universe;
  • There's more money in the US national debt than a penny;
  • There are more grains of sand on earth than one grain of sand.

biggie
Post Reply