That's why I suggested not using time based interrupts. Deterministic processing is trivial as long as you are willing to put up with potentially unbounded running times and slightly decreased performance.

I think this is the one you meant. http://web.archive.org/web/200805210231 ... retro.html

How about this?

* Fixed search depth for each thread
* Deterministic assignment of tasks to threads. E.g. you can have them each serach a tree begining with a different node
* Disable interthread communication while searching and give each thread a local cache for transpositions, killer moves, etc ...

I have attempted to program a tablebase generator several times. (In C++) However each time I run into difficulties and get discouraged.

Does anyone know of any particularly simple and easy to understand open source generators? I hope that by understanding the way other people have done things, it ...