Your trusted source for computer chess information!
Differences
This shows you the differences between two versions of the page.
| computer_chess:engines:myrddin:index 2023/06/11 13:58 | computer_chess:engines:myrddin:index 2023/06/11 14:00 current | ||
|---|---|---|---|
| Line 76: | Line 76: | ||
| -- Myrddin's "Very Lazy SMP" implementation uses (N-1) child processes to fill the transposition, eval and pawn hash tables so the parent process can search deeper in the same amount of time. I believe Myrddin is the only engine that has implemented SMP with this method (and probably rightly so!).\\ | -- Myrddin's "Very Lazy SMP" implementation uses (N-1) child processes to fill the transposition, eval and pawn hash tables so the parent process can search deeper in the same amount of time. I believe Myrddin is the only engine that has implemented SMP with this method (and probably rightly so!).\\ | ||
| -- Myrddin uses Pradyumna Kannan's [[http://www.pradu.us/old/Nov27_2008/Buzz/ | magicmoves]] code for move generation of sliding pieces.\\ | -- Myrddin uses Pradyumna Kannan's [[http://www.pradu.us/old/Nov27_2008/Buzz/ | magicmoves]] code for move generation of sliding pieces.\\ | ||
| - | -- Myrddin uses a tapered eval which was hand-tuned using a very rudimentary Texel tuning system.\\ | + | -- Myrddin uses a tapered eval which was tuned using a very rudimentary Texel tuning system.\\ |
| -- Search is basic alpha/beta, with typical extensions and reductions.\\ | -- Search is basic alpha/beta, with typical extensions and reductions.\\ | ||
| -- All user-modifiable parameters are supported in the INI file, an example of which is included in the download.\\ | -- All user-modifiable parameters are supported in the INI file, an example of which is included in the download.\\ | ||
| Line 131: | Line 131: | ||
| ====Version/Change List==== | ====Version/Change List==== | ||
| + | |||
| + | == Version 0.90 (6/9/23) == | ||
| + | -- Fixed two bugs in SEE (stopped the calculation if the first capture was of equal value, and failed to include Kings in the calculation)\\ | ||
| + | -- Fixed a bug that could cause a save to the hash table even if there was no best move\\ | ||
| + | -- Tuned PST files for the first time, and re-tuned all other eval terms\\ | ||
| + | -- Captures with negative SEE value can now be reduced\\ | ||
| + | -- IID is now more aggressive in its depth reduction and can be applied in PV nodes\\ | ||
| + | -- LMR reduction is now one depth less for PV nodes\\ | ||
| + | -- No longer limiting the number of extensions for a single branch\\ | ||
| + | -- Reduced the number of aspiration windows before performing a full-width search from six to two\\ | ||
| + | -- Fixed a rare bug such that if a tt probe or IID returned an underpromotion it would not be moved to the front of the movelist\\ | ||
| + | -- Fixed an issue when receiving the "force" command while pondering, which can happen with some GUIs\\ | ||
| + | -- Modified the compiler options for magicmoves to improve perft results by 5%.\\ | ||
| + | -- Various minor optimizations\\ | ||
| + | -- Added "see" command to return the SEE value of a capture on the current position - example usage "see d4 e5"\\ | ||
| + | -- Added "rpt" command to run a brief perft test (perft uses bulk counting)\\ | ||
| + | -- Removed "-64" from version string as there is no longer a 32-bit version\\ | ||
| == Version 0.89 (6/3/22) == | == Version 0.89 (6/3/22) == | ||
