Search found 10441 matches

by Dann Corbit
Sat May 01, 2021 8:52 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Nalimov errors
Replies: 16
Views: 7770

Re: Nalimov errors

Great, thank you! Yes mine are larger. When I decompress the downloaded files, they are the same size as the generated files. I haven't checked the checksums, yet, but that looks like the answer. It certainly won't have anything to do with modern compilers "tending to pack on wider block sizes". Ho...
by Dann Corbit
Sat May 01, 2021 8:49 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Nalimov errors
Replies: 16
Views: 7770

Re: Nalimov errors

Great, thank you! Yes mine are larger. When I decompress the downloaded files, they are the same size as the generated files. I haven't checked the checksums, yet, but that looks like the answer. It certainly won't have anything to do with modern compilers "tending to pack on wider block sizes". Ho...
by Dann Corbit
Fri Apr 30, 2021 5:20 am
Forum: Computer Chess Club: General Topics
Topic: This is still one of the hardest position for Engines to solve
Replies: 4
Views: 2272

Re: This is still one of the hardest position for Engines to solve

That would be pow(1.4,(28-2) moves x 2 plies/move)) = pow(1.4, 52) = 39,687,875.83 times as long = 39,687.9 seconds, or .46 days or 11 hours.
by Dann Corbit
Fri Apr 30, 2021 4:38 am
Forum: Computer Chess Club: General Topics
Topic: This is still one of the hardest position for Engines to solve
Replies: 4
Views: 2272

Re: This is still one of the hardest position for Engines to solve

If your chess engine/mate finder can resolve a mate in 2 in one thousandth of a second, it could solve a mate in 28 in 11 hours, assuming a branching factor of 1.4, and there is no zugzwang, and the move ordering is perfect, and the proportionality of the constant is 1.0 In other words, solutions to...
by Dann Corbit
Thu Apr 29, 2021 11:49 pm
Forum: Computer Chess Club: General Topics
Topic: This is still one of the hardest position for Engines to solve
Replies: 4
Views: 2272

Re: This is still one of the hardest position for Engines to solve

For the first problem, the right engines solve it fairly quickly. For the second problem, I assume there must be an esoteric mate of some kind with a move other than Ng5. The "problem" here is that Ng5 wins very easily so all the engines I tried are drawn to it like a magnet. LC0, for instance, foun...
by Dann Corbit
Thu Apr 29, 2021 10:11 pm
Forum: Computer Chess Club: General Topics
Topic: Crafty NNUE Chess Engine?
Replies: 31
Views: 15016

Re: Crafty NNUE Chess Engine?

Suggestion:
If you have fritz, go to the bin folder and get the one built for your machine.
It will be a lot easier than configuring those winboard options by hand.
by Dann Corbit
Thu Apr 29, 2021 9:53 pm
Forum: Computer Chess Club: General Topics
Topic: what is the maximal engine rating that you can win without a queen?
Replies: 18
Views: 3727

Re: what is the maximal engine rating that you can win without a queen?

I do not think that the question has an answer.
Suppose I play only one game, or suppose I play a thousand. The chances of winning a game are not the same.
In any case, for any given Elo pair, the answer is probability based and is also a function of the game count and not just the Elo difference.
by Dann Corbit
Thu Apr 29, 2021 9:48 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: New AMD Ryzen™ Threadripper™ PRO 3995WX (Windows and Multithreading Problem)
Replies: 53
Views: 27468

Re: New AMD Ryzen™ Threadripper™ PRO 3995WX (Windows and Multithreading Problem)

When you reduce the hash size to get higher NPS, is the time to depth smaller or larger on average? I think it is possible that NPS is a red herring. Depending on how they are counted, if a hash hit is not counted as a node, then it might really be a big slowdown. If the hash table is pinned in memo...
by Dann Corbit
Thu Apr 29, 2021 9:44 pm
Forum: Computer Chess Club: General Topics
Topic: Remember Leonid?
Replies: 0
Views: 1971

Remember Leonid?

Some mates in 6 or 7, with varying degrees of difficulty. A large percentage of them are small variations such as color reversal or a piece moved or added.... things like that. On average, quite difficult for mate in 6 or 7. https://drive.google.com/file/d/1f6K_K6Ewt4ttqaL8OwII34ca6Oa-rVNW/view?usp=...