TalkChess.com

In the 90s [...] Main memory was like 256 or 512M. On a high end workstation maybe, but on a standard PC it was more like 1MB in 1990 and 128MB in 1999. Until 1995 many programs were 16 bits and can address only 640kB (with special pointer, or only 64kB with compact pointer). It was possible to use...

Code talks. Talk walks. Where is your RUST chess engine ? Show me the code, and we'll see if RUST is really "simpler" than C. A few years ago, D was supposed to be the C killer (instead of C++ which everyone agrees is an abortion). Now D is dead, and joining the ranks of COBOL (according to TIOBE f...

Hello together, I want to implement the use of "Test Suites", a collections of FEN-Positions with Best Move etc. where the engine can be tested. I do have some questions: Embedded with amoeba , epdtest is a program to run an UCI chess engine against a test suite (in an epd file). It is a command li...

brianr wrote: ↑

Mon Jul 27, 2020 5:30 pm

EPD I think is an extension of FEN with optionally defined fields that accommodate test suites, but not sure about any actual standards.

The description of the epd fields is available within the pgn standard https://www.thechessdrum.net/PGN_Reference.txt

I released Amoeba 3.2 today. Windows and Linux binaries are available here : https://github.com/abulmo/amoeba/releases/tag/v3.2 In self-play Amoeba 3.2 is ~30 Elo stronger than Amoeba 3.1 As usual it comes with a few utilities that may work with other UCI chess engines: - tourney: a trinomial sprt t...

If you need a large number of games to demonstrate the superiority of an engine, it usually means the superiority is not significant. Throwing out draws to calculate WILO has an higher sensitivity over regular ELO when the percentage of draws is reasonable, say 60 or 70%, not when it reaches 99,999....

While correctly working code is most important, 14M nps seems a little on the slow side. Tinker is far from the fastest at perft, but it is about 95M nps on a 3.6GHz CPU. Move generation in Tinker is done with magic bitboards, BTW. 95M nps without bulk counting is very fast. 14 Mnps looks like a go...

While correctly working code is most important, 14M nps seems a little on the slow side. Tinker is far from the fastest at perft, but it is about 95M nps on a 3.6GHz CPU. Move generation in Tinker is done with magic bitboards, BTW. 95M nps without bulk counting is very fast. 14 Mnps looks like a go...

In Amoeba I started with a legal move generator and sorted the full move list. Now I use a staged move generator but still sort partial list of moves (good capture, quiet moves, bad captures). Just picking the best move of an unsorted list of moves did not work well in Amoeba. I think my insertion s...

I ran Rubichess, 84.xxx positions, 250ms time-bonus=on and time-bonus=off EPD : epd\ProDeo.epd Time : 250ms Solving Max Total Time Hash Engine Score Used Time Found Pos Time Score Rate ms Mb Cpu CCRL 1 time-bonus=on 1710890 06:43:40.3 40733 84617 00:19:22.2 2538510 67.4% 250 128 1 3200 2 time-bonus...