A chess engine selects the best move to do given a board configuration. There are several ways to achieve it, despite the common sense, the most used and studied is the simplest: exhaustive search.
In fact, most of deterministic games with two players (chess, checkers, go, etc...) can ...
As I haven't found any explanation on the web about this useful algorithm, I've decided to write this post. Consider this a follow up of the previous post about the n-smallest algorithm.
Actually the problem we wanted to solve in that post was not really the generic ...
I want to highlight a simple trick that I've used in the sampling script of the language detector written in another post.
The trick I'm talking about is the one in the following line:
awk '{print rand() "\t" $0}' | sort -nk1 | cut -f 2-