Software for solving chess moremovers

Discussion of anything and everything relating to chess playing software and machines.

Moderator: Ras

msterkowiec
Posts: 27
Joined: Sat Apr 26, 2025 7:01 pm
Full name: Marcin Sterkowiec

Re: Software for solving chess moremovers

Post by msterkowiec »

Version 11.0 of J.G.Island Chess Moremovers is now ready for download at https://jgisland.pl
It contains further performance improvements: test suite now runs 10% faster compared to ver. 10.0, while brute force analyses are even more affected.
It's worth noting that compared to version 9.4 the program is now about -25% faster (with yet stronger effect on brute force analysis)
This is because of shifting to pure bitboards analysis when solving the final #1 or #2.

This greenfield code is now being polished and within a few days it is expected to be available on github.
The main idea was to use as little data as possible (L1 cache-friendliness), so Hyperbola Quintessence approach was adopted with only 6kB of auxiliary data.
Under investigation there's an alternative to use additional 16kB with BetweenMasks - isolated tests show performance improvement, however it significantly affects L1 cache usage, so the overall effect in real action is unsure for me yet. As soon as all the tests look good, this further improvement will be adopted in ver. 11.1.
msterkowiec
Posts: 27
Joined: Sat Apr 26, 2025 7:01 pm
Full name: Marcin Sterkowiec

Re: Software for solving chess moremovers

Post by msterkowiec »

Now JGIsland_BB available on github: https://github.com/msterkowiec/JGIsland_BB
A separate thread created for this topic: viewtopic.php?t=86584
msterkowiec
Posts: 27
Joined: Sat Apr 26, 2025 7:01 pm
Full name: Marcin Sterkowiec

Re: Software for solving chess moremovers

Post by msterkowiec »

J.G.Island Chess Moremovers ver. 11.2 is ready for download at jgisland.pl. It contains significant improvements in performance (about 15% vs. ver 11.1)

The previously mentioned library (https://github.com/msterkowiec/JGIsland_BB) has meanwhile been slightly updated and now about 35 two-movers are solved within 1 millisecond (in all solutions mode).