TalkChess.com

ankan wrote:

Dann Corbit wrote: Do you have stored statistics, such as how many mates are in the first 15 ply, how many stalemates, etc.?

Unfortunately no. I can modify my program to count these statistics - but it will probably become quite a bit slow. I would guess counting these will for first 14 ply would take about the same time as the perft 15 computation took.

I strongly suspect that your move generator (since it must detect mates to get the correct answer ) would create the strongest mate prover eve imagined.

Isn't it time to give Chest319 some competition?

Dann Corbit wrote: I strongly suspect that your move generator (since it must detect mates to get the correct answer ) would create the strongest mate prover eve imagined.

Isn't it time to give Chest319 some competition?

Yes, that's the next thing I plan to attempt. However the main issue is alpha-beta pruning (and current parallel search algorithms based on that) is not something that scales well to thousands to millions of threads. I have some plans and am going to try out a few things. Will update if I have any success with it.

ankan wrote:

Dann Corbit wrote: I strongly suspect that your move generator (since it must detect mates to get the correct answer ) would create the strongest mate prover eve imagined.

Isn't it time to give Chest319 some competition?

Yes, that's the next thing I plan to attempt. However the main issue is alpha-beta pruning (and current parallel search algorithms based on that) is not something that scales well to thousands to millions of threads. I have some plans and am going to try out a few things. Will update if I have any success with it.

I am so excited that someone with your immense talent is looking at this.

I expect the best mate finder (by at least two orders of magnitude) will be the result.

You have to really understand these GPU boards to get the horsepower out of them. I am really geeked to see people of great talent putting their brains at risk to solve these difficult problems.
!

Nice work! Congratulations!!

Thanks all. Wouldn't have been possible without encouragement from everyone in this forum (especially Steven).

Kudos from Germany......years of compute cycles compressed into 5 days, impressive.

--
Srdja

Hello Dann:

Dann Corbit wrote:Do you have stored statistics, such as how many mates are in the first 15 ply, how many stalemates, etc.?

The current shortest known stalemates are 19-ply stalemates. It was discussed in the following thread:

estimating the number of possible stalemates in perft(n)

Regarding checks, checkmates, discovered checks and so on, you can get interesting info for some depths at this site:

Statistics on chess games

Dann Corbit wrote:I strongly suspect that your move generator (since it must detect mates to get the correct answer ) would create the strongest mate prover eve imagined.

Isn't it time to give Chest319 some competition?

It would be great. By the way, should not ChestUCI 5.2 be somewhat better than Chest 319? Just asking.

Regards from Spain.

Ajedrecista.

What is Chest319 ? What method does it use ?

Nice job Ankan ! With 4 DGX-1 the job is getting faster then
I look forward to try your tool on my servers at work too !

bhamadicharef wrote:What is Chest319 ? What method does it use ?

Chest is the best available mate solver, by Heiner Marxen.
It comes in two formats:
Command line driven and also as a UCI engine. The UCI version has lots of options.