Hacker News .hnnew | past | comments | ask | show | jobs | submitlogin

A few minor corrections. First, most chess programs don't literally "brute force" the problem. A lot of work goes into pruning the search tree and only looking along the most promising paths. Second, humans can actually think many moves ahead along certain paths.

As other's have stated in this thread chess is particularly well suited to be played well by a computer program, but that does not make it trivial.



They don't brute force only because processor power isn't sufficient to do so. Eventually they will cease to prune and will be unbeatable.

I'd never say chess is trivial, it's just far less complex than poker.


> Eventually they will cease to prune and will be unbeatable.

No, they won't. The universe isn't big enough for a computer that would play brute force in a reasonable amount of time.




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

Search: