Hacker News new | past | comments | ask | show | jobs | submit login

What's really misleading is when people try to push the question aside by saying "AI techniques should work." It's dodging the question. What I ask is whether there is an efficient algorithm to determine if one player can force a win, given a position on an arbitrary size board. Forget whether the game is imbalanced. It's just a mathematical question.

You say this game is less complicated than chess, but what measure of complexity are you talking about? Might it be computational complexity? Computer scientists of all people know that simple rules can provide arbitrary complexity.




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

Search: