Re:AlphaGo beats Lee Sedol again in match 2 of 5
by ekianjo on Thursday March 10, 2016 @05:41AM
(#11258380)
I am not sure that calculating the raw number of positions is a good indication of complexity at a given point. What if most positions are obviously junk in go while they are more difficult to assess in chess? Not saying this is the case in this particular example but thats a possibility in theory.
[ Parent
| on HN ]
Re:AlphaGo beats Lee Sedol again in match 2 of 5
by eru on Thursday March 10, 2016 @06:06AM
(#11258466)
To illustrate your point: you can just add rows to a game of Nim (https://en.wikipedia.org/wiki/Nim) to get a truly enormous state space, without changing the simple winning strategy.
Re:AlphaGo beats Lee Sedol again in match 2 of 5
by masklinn on Thursday March 10, 2016 @05:56AM
(#11258433)
> What if most positions are obviously junk in go while they are more difficult to assess in chess?
I wouldn't go with most (because I don't know about that), but many of these boards would also be either impossible to achieve (in a normal game) or illegal.
Re:AlphaGo beats Lee Sedol again in match 2 of 5
by aardvark179 on Thursday March 10, 2016 @06:07AM
(#11258472)
The 10^170 figure is legal positions. It's about 1% of possible board positions. How many of those are sensible is another matter.