Comment Re:Simple chess engine (Score 1) 281
I don't think you 'll find an engine on the market that can solve this problem in a reasonable amount of time. However, it looks to me that you could write one for this particular problem. The main decision you have to take is how deep you are going to use brute force before you filter the results.
Old Wolf wrote: "There are 119,060,324 different 6ply (3 moves) chess games". So abouth 6 million that start with e2-e4.
In the vast majority of these games it will not be possible for a knight to capture a rook in two moves. Checking for this condition can be done very fast ( 3,812,256 different positions for the four pieces,which are either valid or invalid: an array small enough to be kept in RAM).
You're left with a number of valid positions ( anyone an idea how many?) to consider. Depending on who mates, you'll have between 40 and 3000 possible moves to check (rough estimates).
My conclusion: the number of positions to examine will be in the order of 10**9. Writing the program will probably take you more time than running it.
Old Wolf wrote: "There are 119,060,324 different 6ply (3 moves) chess games". So abouth 6 million that start with e2-e4.
In the vast majority of these games it will not be possible for a knight to capture a rook in two moves. Checking for this condition can be done very fast ( 3,812,256 different positions for the four pieces,which are either valid or invalid: an array small enough to be kept in RAM).
You're left with a number of valid positions ( anyone an idea how many?) to consider. Depending on who mates, you'll have between 40 and 3000 possible moves to check (rough estimates).
My conclusion: the number of positions to examine will be in the order of 10**9. Writing the program will probably take you more time than running it.
