Ajedrecista wrote:
------------------------
I use JetChess 1.0.0.0 perft counter to give an idea of the tree size of the original position (before playing 1.- Qdxe6):
[D]1qbqkbq1/QBRNBNQ1/1QnQpQn1/1q1RQ1p1/3rn3/2Q2Q2/Q6K/1r4r1 w - - 0 1
Looks like my move generator is OK here. Fortunately, you were kind enough to not post the JetChess search times (which would have made mine look very bad, I'm sure).
Specifically, there are 1,112,569 checkmates between mate in 1 and mate in 8.
Each checkmate has been verified by Chest319 (so brute force, no shortcuts).
If you like solving chess puzzles or are otherwise deranged, you might enjoy it.
The file contains the positions which are annotated with the solutions.
From time to time, I will add to the collection.
Thanks for the great file.
Would you be able to provide a version ordered in terms of distance to mate, eg all mate in 1 followed by mates in 2...
The records are all tagged with the distance to mate. Records that have "dm 4;" in them are 'direct mate in four' and records that have "dm 1;" in them are direct mate in one.
If you are using windows, from a command prompt you can do things like this:
findstr "dm 1;" ischmat.epd > dm1.epd
which will create a file of every mate in one that is contained in the file.
If you are using some unix/posix sort of environment you can use grep or sed or what have you.
You know that this material could be nice for each programmer. Can be sorted with tools ...
Example:
3-10 pieces on board
10-16 pieces on board
After this one programmer can use your work and have a chance for a good test with the own engine and the correct way to mate ... with different quantity of pieces on the board.
Important work because it's one of the main problems today. Most programmer using for own eng-eng matches resign=on and can't see the problems with time loses before mate or the wrong way to mate.
Chest is really a great work!
Best
Frank
Of course, these positions can be added to the ChestUCI database. I would have no objection to that.
In addition, you can import EPD records into many database systems like SCID and ChessAssistant.
Then you can use the power of the database to find exactly what you are looking for.
Perhaps I will create a simple SQL interface using SQLite or something like that so that people can make any kind of query that they like to find problems that they are interested in.
But there are already existing tools that do that kind of thing.
I have now solved 1112567 myself but I struggle with the 1112568th
If you add 1543 more you will have exactly 0x110000 which of course should be celebrated !
Seriously - how is it possible to collect so many - if you spent 1 minute on each you would have used more than two years if you worked round the clock !
Thanks anyway for this wonderful collection
Regards Andreas
Specifically, there are 1,112,569 checkmates between mate in 1 and mate in 8.
Each checkmate has been verified by Chest319 (so brute force, no shortcuts).
If you like solving chess puzzles or are otherwise deranged, you might enjoy it.
The file contains the positions which are annotated with the solutions.
From time to time, I will add to the collection.
Thanks for the great file.
Would you be able to provide a version ordered in terms of distance to mate, eg all mate in 1 followed by mates in 2...
The records are all tagged with the distance to mate. Records that have "dm 4;" in them are 'direct mate in four' and records that have "dm 1;" in them are direct mate in one.
If you are using windows, from a command prompt you can do things like this:
findstr "dm 1;" ischmat.epd > dm1.epd
which will create a file of every mate in one that is contained in the file.
If you are using some unix/posix sort of environment you can use grep or sed or what have you.
Thanks again Dann. The command works fine.
Now all I have to do is to start with the mate in 1 problems and work my way through the whole file. I should be ready to take on Carlsen when I finish.
bnst wrote:I have now solved 1112567 myself but I struggle with the 1112568th
If you add 1543 more you will have exactly 0x110000 which of course should be celebrated !
Seriously - how is it possible to collect so many - if you spent 1 minute on each you would have used more than two years if you worked round the clock !
It's an illness.
You should see how many positions I have analyzed that are not mates.
What you are looking at is the toenail of the giant.
Thanks anyway for this wonderful collection
Regards Andreas
Specifically, there are 1,112,569 checkmates between mate in 1 and mate in 8.
Each checkmate has been verified by Chest319 (so brute force, no shortcuts).
If you like solving chess puzzles or are otherwise deranged, you might enjoy it.
The file contains the positions which are annotated with the solutions.
From time to time, I will add to the collection.
Thanks for the great file.
Would you be able to provide a version ordered in terms of distance to mate, eg all mate in 1 followed by mates in 2...
The records are all tagged with the distance to mate. Records that have "dm 4;" in them are 'direct mate in four' and records that have "dm 1;" in them are direct mate in one.
If you are using windows, from a command prompt you can do things like this:
findstr "dm 1;" ischmat.epd > dm1.epd
which will create a file of every mate in one that is contained in the file.
If you are using some unix/posix sort of environment you can use grep or sed or what have you.
Thanks again Dann. The command works fine.
Now all I have to do is to start with the mate in 1 problems and work my way through the whole file. I should be ready to take on Carlsen when I finish.
Spoke too soon. Dann's command doesn't work for me as it gives all the problems. This works for me.
