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

Saw the AlphaGo movie at a festival recently.

Been following the AlphaGo Zero developments, which leap-frog what was going on in the movie (although still very much worth seeing).

One thing I was curious about is if Go would be considered solved, either hard or weakly solved, since AlphaGo Zero at this point doesn't seem to be able to be beat by any living human. Wikipedia does not list it as solved in either sense, and I was wondering if this was an oversight.



Go still has not been Ultra-weakly solved (eg. we do not know who is supposed to win).

If AlphaGo has weakly solved go, then it should either have a 100% win rate when playing against itself as white, or a 100% win rate when playing against itself as black.


Or 100% rate of a draw. Like tic tac toe.


Due to komi, a go game cannot be drawn. That is, the 2nd player is awarded some number of points for the disadvantage of moving 2nd, and that number of points typically has a fractional 0.5 in it to break ties.

The most common komi values these days are 6.5 or 7.5, depending on ruleset.


Depending on the rules, a game may be drawn due to an "eternal life" (an endless forced repetition).

https://senseis.xmp.net/?EternalLife

In Go this is very rare (as opposed to e.g. chess).


if alpha go is just an adversarial network to brute force states, then it is not solved (note I don't research alphaGo, and most of what I know about it is from HN comments)




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

Search: