I have refreshed the contents of a couple of

*Symbolic's* log file links which were posted earlier. For easier web browser viewing, I have removed the ANSI color escape sequences.

The first is

*Symbolic* doing

*perft(n)* (n=7..10):

https://dl.dropboxusercontent.com/u/316 ... 8p9p10.log
The second is

*Symbolic* doing

*perft(11)*:

https://dl.dropboxusercontent.com/u/316 ... es/p11.log
There have been some minor speed improvements for a total of about a five percent rate increase.

----

When I first calculated

*perft(7)* ca. 1987, it took about 36 hours; now it takes less than a second. When I first calculated

*perft(10)* ca. 2002, it took about two weeks; now it takes about 21 minutes.

*Perft(11)* now takes about 4 hours and 45 minutes.

And when running without bulk counting nor transposition table assistance,

*Symbolic* can run

*perft()* on a complex position (

*BusyFEN*) at the rate of about 42 million nodes per second.

----

The essentials of

*Symbolic's* multithreaded, semaphore-moderated job/accumulator path enumeration scheme are unchanged. That's good, because it helps prove the validity of

*Symbolic's* upcoming multithreaded, semaphore-moderated job/pallet α/β search scheme which should make all other searches turn

green with envy.

----

For those who want more than just a hundred or so

*perft(7)* test positions, here are the first ten million of them from the

*unique(7)* set:

https://dl.dropboxusercontent.com/u/316 ... 000.sum.gz
https://dl.dropboxusercontent.com/u/316 ... 001.sum.gz
...

https://dl.dropboxusercontent.com/u/316 ... 099.sum.gz