See also:  
Ein Programm für Schachprobleme

Un programme pour les problèmes d'échecs
by Jan Nowakowski

Un programma per la soluzione
di problemi di scacchi

Un programa especialista
en problemas de ajedrez
A mirror of this page:
ChessExplorer   version 6.3
Download ChessExplorer ,  412 KB
Terms of using


ChessExplorer is a Windows software (Win32), principally designed to solving orthodox chess problems: direct mates, selfmates, helpmates and also seriesmovers.
It has some additional options: Generally, ChessExplorer is created to test all possible moves and to find exactly all solutions that exists (mode "brute force" - using big force of modern computers).
This principle isnít violate by added some "bits of intelligence" (for exemple, a side who defends to mate, "remembers" his good, already verified moves, and he doesnít need test every time all posible moves).

The basic procedures was optimized in assembly language and the program tests more than 1,000,000 moves per second (sometimes more than 10,000,000 m/sec) on a standard computer.
This speed is possible with the processors of the Pentium family and similar processors. Multi-pipeline architecture of this processors and other features ( e.g. mechanism of prediction of direction of conditional jumps in the program ) causes that the programme is executed quickly that on "old" traditional processors.
For exemple, in option "Counting variants in 6 moves" from the initial position of the chessboard with P II Celeron 366 MHz, the speed is about 3,000,000 moves per second. This means that for one move about 120 clock cycles one needs.
For one move of chess piece one need least some hundreds of commands of processor ( testing if the king is checked, counting of moves, showing of results etc. ) and the "old" processors would use up for this some thousands' of clock cycles.
It seems me that this 120 clock cycles it is probably near to the limit of possibility of optimization of olgorithm ( unless someone will find some brilliant idea ! ).
Shareware program: after a trial period of one month, you must register it (see: Terms of using ).


Additional options:
Solving problems.

Creating problems.

Option "Positions" ( "8-Queens non-attacked" ).

Option "Positions" ( "Maximum of attacking squares" ).


Jan Nowakowski

The copy of this side is also at the address: