
http://wbec-ridderkerk.nl/html/download.htm
As usual, source code available and licensed under GNU GPL v3. It is still portable and should compile on any plateform (Mac OSX, and generally any UNIX compatible system, also Google Android). The official compiles are 64-bit only, for both Linux and Windows, but Jim Ablett kindly provided other compiles.
If you're not sure which compile is fastest on your computer, or want to be certain that the compile you have is correct, run the program from a command line with an argument (whichever argument you want doesn't matter, so long ar there is at least one)
* It will run a benchmark test, searching several positions in a row at given depth, and return a time and node count
* The node count is a signature that ensures that the compile is correct. The correct node count should be 5784711.
* The time of course depends on your computer. If you want to know, mine does it in about 14.1 seconds.
In terms of changes, there hasn't been very much. I mostly tweaked search reductions and search extensions, as well as introduced a rather "uncommon" way of doing eval pruning and razoring.
I'd be happy if any of the rating lists could test it, because I don't have any precise idea of its level. This is because I almost only do self testing at very fast time control. And this tends to overestimate any improvement.
Enjoy!
Lucas