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

One of the biggest innovations in computer Go has been the idea that you can evaluate a position in "monte carlo" fashion, by just playing a few random games from that position and seeing who wins. I don't know whether the same idea extends to Chess.


Monte carlo chooses some possible moves at random, then evaluates which is most successful and has a bias towards the more successful ones.

This has the randomness but without any bias or evaluation of effectiveness.

But really, Monte Carlo in Go can basically be thought of as a lazy, intelligent brute-forcing method.




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

Search: