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

But you won't find a set of moves. You have to find a tree of moves, which is substantially larger.


This is true. It is still a massive problem space but my point is that you don't need to consider every possible game or state.


Not to prove it always-winning; you only have to go down every possible branch for the other player for that (i.e. √ of the number of states you'd otherwise need). To find it, though? Well, unless you hit lucky, you're going to be considering pretty much every possible game or state, except where you can find shortcuts.


It is a bit more than that as it is unlikely that the always win sequence would be a fixed list of moves. You would need to show that for you each move the other player makes you have a reaction that also wins.




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

Search: