If you have 64-bit hardware, and at least 2 GB of RAM to give to the program, this version will be much improved.
As you can see from the image above, on my machine, this program searches over 17 million positions per second from the starting position.
The node count is displaying a number > 6 billion, indicating the 64-bit counter is working fine (otherwise a number > 4.2 billion would become negative).
You can also see (db: 234881) on the screen shot above. This shows the number of times the 6-piece database has been probed.
Even from the starting position, it can hit the database, in this case over 200,000 times.
My changes to version 1.10:
1. All node counts are now 64-bit variables. That means once the number of positions explored > 4.2 billion, the counter won't become a negative number, which really represents a 32-bit counter that has overflowed.
2. Visual Studio 2015 was used to compile it as a native 64-bit application.
3. I made the hash table 100 times larger. When doing very deep searches using a custom time/depth (I use depth = 99 or time = 9999 seconds/move) the search depths will be incredibly deep.
4. The program requires 1.6 GB of RAM to load the 6-piece perfect play databases + the new extended hash table. So a machine with at least 2 GB of RAM free is needed.
5. This version displays the new creation date (August 31, 2016) and the fact that I ported it to a 64-bit environment.
The author's changes from 1.05 to 1.10
1. The move generator is a faster bitboard implemention (the older version used an array move generator)
2. I gave Jonathan Kruezer my 6-piece database access code + perfect play databases, which are now probed in RAM as it searches. This is a huge performance gain over the older version.
If you want version 1.11, which is presently not available anywhere, please let me know.
