Compare your engine's performance: Corrections +++

[Chessnut1071]

I really want to find out how chessmaster finds all the above mates in under a minute.

I'm wondering if chessmaster has a database of every published mate and found it in a database search. I can't believe that time. Anybody know how they did it?

Johan spent a great deal of time not only making The King an excellent mate-finder for its day, but also ensuring that every mate it found was absolutely correct. He never told me his method, though.

Any way he will agree to put it in the public domain? He should think about that before somebody else does, and I'm sure in time somebody will.

[amanjpro]

I really want to find out how chessmaster finds all the above mates in under a minute.

I'm wondering if chessmaster has a database of every published mate and found it in a database search. I can't believe that time. Anybody know how they did it?

Johan spent a great deal of time not only making The King an excellent mate-finder for its day, but also ensuring that every mate it found was absolutely correct. He never told me his method, though.

Any way he will agree to put it in the public domain? He should think about that before somebody else does, and I'm sure in time somebody will.

I don't think he is allowed to do that... He was working for a company, and the intellectual property belongs to whichever company ended up acquiring the said company. Chessmaster was a commercial product

[Chessnut1071]

I really want to find out how chessmaster finds all the above mates in under a minute.

I'm wondering if chessmaster has a database of every published mate and found it in a database search. I can't believe that time. Anybody know how they did it?

Johan spent a great deal of time not only making The King an excellent mate-finder for its day, but also ensuring that every mate it found was absolutely correct. He never told me his method, though.

Any way he will agree to put it in the public domain? He should think about that before somebody else does, and I'm sure in time somebody will.

I don't think he is allowed to do that... He was working for a company, and the intellectual property belongs to whichever company ended up acquiring the said company. Chessmaster was a commercial product

So, what's to prevent some hack from downloading the chip and publishing the code? I know it can be done because McFarland did it 12 years ago. He's dead now so I can use his name.

[amanjpro]

I really want to find out how chessmaster finds all the above mates in under a minute.

I'm wondering if chessmaster has a database of every published mate and found it in a database search. I can't believe that time. Anybody know how they did it?

Johan spent a great deal of time not only making The King an excellent mate-finder for its day, but also ensuring that every mate it found was absolutely correct. He never told me his method, though.

Any way he will agree to put it in the public domain? He should think about that before somebody else does, and I'm sure in time somebody will.

I don't think he is allowed to do that... He was working for a company, and the intellectual property belongs to whichever company ended up acquiring the said company. Chessmaster was a commercial product

So, what's to prevent some hack from downloading the chip and publishing the code? I know it can be done because McFarland did it 12 years ago. He's dead now so I can use his name.

Well, there is nothing to prevent me from stealing neighbor's car too... I know it can be done, someone else did it successfully. Stealing is stealing, be it software or physical objects

[Uri Blass]

Related to my recent thread, how do we even know that mate in 7 is optimal? I mean, I believe that it is, but some engines here need 20+ or even 30+ depth to find mate in 7, how'd one know when the shortest mate is found?

Because I used Chessmaster's mate finder, and it took only five seconds to confirm that there was no mate in 6. But it took another fifty seconds to confirm the mate in 7.

I use chest mate finder that should be free source code.
It took less than 2 minutes to find the mate in 7 and find that there is no different solution(I do not know if it is faster or slower than chessmaster's mate finder because you may have a better hardware).

Chest can use only a single core so it did not use more than 1 core(not sure about chessmaster).
Chest is also limited not to use more than 2048 mbytes for hash tables.

FEN: 5k2/ppp2r1p/2p2ppP/8/2Q5/2P1bN2/PP4P1/1K1R4 w - - 0 1

ChestUCI:
FEN: 5k2/ppp2r1p/2p2ppP/8/2Q5/2P1bN2/PP4P1/1K1R4 w - - (9+10)
Stellungs-Analyse: C0/R0/K4/P8/X23 W:7/46
Suche nach Matt in 126 ... (Hash=2044MB)
7 01:22 98,232k 1,253k +M7 Qc4-e4
Suche abgeschlossen ... (Zeit=114.07s)
Matt in 7 gefunden ! (1 Lösung in 01:54)
7/7 01:54 142,436k 1,249k +M7 Qc4-e4 Be3xh6 Rd1-d8+ Kf8-g7 Nf3-d4 Bh6-g5 Nd4-e6+ Kg7-h6 Rd8-d3 f6-f5 Rd3-h3+ Bg5-h4 Rh3xh4+

[Uri Blass]

link to download chest that I found
https://fhub.jimdofree.com/

[JVMerlino]

I really want to find out how chessmaster finds all the above mates in under a minute.

I'm wondering if chessmaster has a database of every published mate and found it in a database search. I can't believe that time. Anybody know how they did it?

Johan spent a great deal of time not only making The King an excellent mate-finder for its day, but also ensuring that every mate it found was absolutely correct. He never told me his method, though.

Any way he will agree to put it in the public domain? He should think about that before somebody else does, and I'm sure in time somebody will.

I don't think he is allowed to do that... He was working for a company, and the intellectual property belongs to whichever company ended up acquiring the said company. Chessmaster was a commercial product

Not only that, we never got the source for the engine, as I'm sure that was the agreement. Johan just supplied us with an exe.

[Chessnut1071]

I really want to find out how chessmaster finds all the above mates in under a minute.

I'm wondering if chessmaster has a database of every published mate and found it in a database search. I can't believe that time. Anybody know how they did it?

Johan spent a great deal of time not only making The King an excellent mate-finder for its day, but also ensuring that every mate it found was absolutely correct. He never told me his method, though.

Any way he will agree to put it in the public domain? He should think about that before somebody else does, and I'm sure in time somebody will.

I don't think he is allowed to do that... He was working for a company, and the intellectual property belongs to whichever company ended up acquiring the said company. Chessmaster was a commercial product

Not only that, we never got the source for the engine, as I'm sure that was the agreement. Johan just supplied us with an exe.

Now I'm very curious, the solution-all 7-move mates- for that puzzle takes around 1 billion node searches for an engine efficient. Mine takes over 1.8 billion, but, I was focused on accuracy, not speed yet. I haven't seen anything running on a single core chip reach any where near that speed. I can understand if he was using a supercomputer or bank of servers, but, apparently they achieve that speed on a 10-year old, single core chip. Now, I'm focused on speed and would love to get some idea how he did it. Maybe somebody can simply post the code here for us to peruse, C# or C++ please.

[Uri Blass]

I really want to find out how chessmaster finds all the above mates in under a minute.

I'm wondering if chessmaster has a database of every published mate and found it in a database search. I can't believe that time. Anybody know how they did it?

Johan spent a great deal of time not only making The King an excellent mate-finder for its day, but also ensuring that every mate it found was absolutely correct. He never told me his method, though.

Any way he will agree to put it in the public domain? He should think about that before somebody else does, and I'm sure in time somebody will.

I don't think he is allowed to do that... He was working for a company, and the intellectual property belongs to whichever company ended up acquiring the said company. Chessmaster was a commercial product

Not only that, we never got the source for the engine, as I'm sure that was the agreement. Johan just supplied us with an exe.

Now I'm very curious, the solution-all 7-move mates- for that puzzle takes around 1 billion node searches for an engine efficient. Mine takes over 1.8 billion, but, I was focused on accuracy, not speed yet. I haven't seen anything running on a single core chip reach any where near that speed. I can understand if he was using a supercomputer or bank of servers, but, apparently they achieve that speed on a 10-year old, single core chip. Now, I'm focused on speed and would love to get some idea how he did it. Maybe somebody can simply post the code here for us to peruse, C# or C++ please.

I remember reading that chest use many tricks to detect no possible mate in 1 or no possible mate in 2 even without searching
I do not know the exact tricks but basically if the opponent king has many possible moves it is obvious that you cannot cover all the escape search in one move even without searching all the moves.

Of course searching all the moves to find mate in 1 is a bad idea and basically you need to search only checking moves.

[klx]

There is no pruning, only AB-cuts, but with some special features. It ranks moves via MVV/LVA, depth killers, and history, but ranks check-delivering moves above all.

Interesting text. I have a mate finder with most of the same metrics, but, a modified MVV-LVV. It uses the actual material consequences of the move set instead. The algorithms uses alpha-beta, history, material consequence and check.

Do you guys use a transposition table? If so, how do you ensure correctness? See my recent post here for why a "regular" use of transposition table may give the incorrect result in a mate finder.