Search found 4423 matches
- Sat Jan 16, 2021 8:49 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Endgame tablebase generation for newbies
- Replies: 15
- Views: 2655
Re: Endgame tablebase generation for newbies
There exist statistics for distance to mate, but I don't think it exists for distance to promotion. You should be careful there anyway: not all promotions are winning. You should calculate until the first move with the promoted piece. It think it is sufficient to check that the promoted piece canno...
- Wed Jan 13, 2021 9:54 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: g++10 versus g++9
- Replies: 5
- Views: 514
- Sun Jan 03, 2021 6:47 pm
- Forum: Computer Chess Club: General Topics
- Topic: +100 elo breakthrough in new rewritten Lco engine ( Ceres)
- Replies: 97
- Views: 9395
Re: +100 elo breakthrough in new rewritten Lco engine ( Ceres)
Some people are interested in technical details. You are not one of them, but I am not writing for you alone.corres wrote: ↑Sun Jan 03, 2021 2:56 pmThere is no any new announcement there.syzygy wrote: ↑Sun Jan 03, 2021 2:40 pmThis seems to be a list of improvements:
https://github.com/dje-dev/Ceres#implem ... n-features
- Sun Jan 03, 2021 2:40 pm
- Forum: Computer Chess Club: General Topics
- Topic: +100 elo breakthrough in new rewritten Lco engine ( Ceres)
- Replies: 97
- Views: 9395
Re: +100 elo breakthrough in new rewritten Lco engine ( Ceres)
This seems to be a list of improvements:
https://github.com/dje-dev/Ceres#implem ... n-features
https://github.com/dje-dev/Ceres#implem ... n-features
- Sun Jan 03, 2021 2:24 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Stockfish default bench can be easily improved
- Replies: 4
- Views: 707
- Sun Jan 03, 2021 2:23 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: YBW engines past and present?
- Replies: 15
- Views: 1716
Re: YBW engines past and present?
Did you try LazySMP? Easy as falling off of a log and seems to work really well. It's insane that seemingly small tweaks to what was considered the worst-scaling algorithm (shared hash table) somehow produces the best one. I don't think the small tweaks made the difference. In the old days testing ...
- Thu Dec 31, 2020 12:42 am
- Forum: Computer Chess Club: General Topics
- Topic: Dispelling the Myth of NNUE with LazySMP: An Analysis
- Replies: 39
- Views: 2359
Re: Dispelling the Myth of NNUE with LazySMP: An Analysis
Not long ago, it was believed by many, myself included, that making use of Hyperthreads for engine play was sub-optimal. At one point Fishtest's wikis contained guidance to Users to not use Hyper-threads. Similarly, Houdini once came with such a disclaimer. The use of hyperthreads for fishtest is a...
- Tue Dec 29, 2020 7:48 pm
- Forum: Computer Chess Club: General Topics
- Topic: Draw by 3 fold repetition...
- Replies: 33
- Views: 1274
Re: Draw by 3 fold repetition...
It would be preferring -0.24 over -0.25. If a draw is evaluated as -0.24, then moves leading to a -0.23 evaluation would be preferred over moves leading to a draw.
- Tue Dec 29, 2020 7:43 pm
- Forum: Computer Chess Club: General Topics
- Topic: Draw by 3 fold repetition...
- Replies: 33
- Views: 1274
Re: Draw by 3 fold repetition...
If you think that some move should be different then you should give a position and say what move stockfish played and what it should play based on your opinion. I am just asking those who know how engines are coded why a top engine like stockfish "accepts" to get into a position where the opponent...
- Tue Dec 29, 2020 2:21 pm
- Forum: Computer Chess Club: General Topics
- Topic: Draw by 3 fold repetition...
- Replies: 33
- Views: 1274
Re: Draw by 3 fold repetition...
If SF always search for opponent's possible checks to its king's in say next n moves we can then assume that when a 3 repetition by forced checks occurs SF is never taken by surprise then ? Yes. Stockfish knows that this will be draw through repetition. In particular, checks are extended in search ...