Timeline for Simplest chess engine to reach 2000 ELO?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 30, 2015 at 8:29 | vote | accept | rodrigob | ||
| Aug 30, 2015 at 4:17 | comment | added | SmallChess | @rodrigob SSE helps, and it's easy to implement. I implemented SSE later in the development, no particular reason, just personal preference. As long as you have a reasonable evaluation, and implement the those mentioned techniques well, you should not have a problem reaching 2000. | |
| Aug 30, 2015 at 4:15 | comment | added | SmallChess | @rodrigob I think q-search, hashing and null-move are the most important. Of course, you'll need a good like iterative deepening, sorting the PV moves, good evaluation to make it work. | |
| Aug 29, 2015 at 19:27 | comment | added | rodrigob | Why is SSE only added "at the end"; would not that alone help remove some of the previous ingredients ? Out of the ones you mention; which one you think made the most impact ? | |
| Aug 29, 2015 at 19:26 | comment | added | rodrigob | Indeed CCRL ELO is not "one to one" with humans, but it is easier to measure (while coding an engine); so that is the measure I pick: "2000 ELO on CCRL 40/4". | |
| Aug 29, 2015 at 15:58 | history | edited | SmallChess | CC BY-SA 3.0 |
added 16 characters in body
|
| Aug 29, 2015 at 14:37 | history | edited | SmallChess | CC BY-SA 3.0 |
edited body
|
| Aug 29, 2015 at 14:32 | history | edited | SmallChess | CC BY-SA 3.0 |
added 91 characters in body
|
| Aug 29, 2015 at 14:22 | history | answered | SmallChess | CC BY-SA 3.0 |