News for hackers. Stuff that matters.
Re:Chess: Who will win in this riveting game of Math.random(... by lmm on Monday January 26, 2015 @05:11AM (#8946297)
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.
Re:Chess: Who will win in this riveting game of Math.random(... by Qwertious on Monday January 26, 2015 @06:30AM (#8946490)
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.