I added code to measure the time taken to search each ply and calculate if enough time remains to search the next ply. This lessens the number of searches that must be abandoned in the middle of a ply, and the best move from the prior ply played. These abandoned searches waste time.
This added 24 Elo to the playing strength of MadChess 2.0 Beta. I believe improved time management will pay greater dividends once I add search reductions and pruning of moves.
MadChess 2.0 1694 : 800 (+101,=54,-645), 16.0 % vs. : games ( +, =, -), (%) : Diff, SD, CFS (%) BikJump v2.01 : 100 ( 7, 5, 88), 9.5 : -385, 16, 0.0 Matheus-2.3 : 100 ( 3, 4, 93), 5.0 : -373, 15, 0.0 Monarch 1.7 : 100 ( 9, 12, 79), 15.0 : -338, 16, 0.0 BigLion 2.23w : 100 ( 13, 6, 81), 16.0 : -312, 14, 0.0 Faile 1.4 : 100 ( 10, 2, 88), 11.0 : -306, 13, 0.0 Sharper 0.17 : 100 ( 17, 6, 77), 20.0 : -292, 15, 0.0 Jabba13032012 : 100 ( 19, 11, 70), 24.5 : -234, 14, 0.0 Roce 0.0390 : 100 ( 23, 8, 69), 27.0 : -160, 14, 0.0
| Feature | Category | Date | Rev1 | WAC2 | Elo Rating3 | Improvement |
|---|---|---|---|---|---|---|
| Time Management | Search | 2014 Dec 08 | 25 | 231 | 1694 | +24 |
| Delay Move Generation Aspiration Window Bug |
Search | 2014 Dec 02 | 23 | 231 | 1670 | +44 |
| MVV / LVA Move Order Draw By Insufficient Material Move List Overflow Bug |
Search | 2014 Dec 01 | 22 | 235 | 1626 | +30 |
| Tapered Evaluation MG and EG Piece Location |
Evaluation | 2014 Nov 29 | 21 | 234 | 1596 | +107 |
| Alpha / Beta Negamax Aspiration Windows Quiescence, Hash Material, Piece Squares |
Baseline | 2014 Nov 25 | 20 | 236 | 1489 | – |
- Subversion source code revision
- Win At Chess position test, 3 seconds per position
- Bullet chess, 2 min / game + 1 sec / move
I work as a Software Architect at an insurance company. We're building a modern tech stack in the cloud using C#, Azure, ASP.NET Core, Angular, TypeScript, etc.