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

You can still brute force all game states in a tree with height n, with some heuristic to estimate the strength of position at each game state. I certainly don't think humans solve Go, because I've never heard of any experts being undefeated.


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

Search: