Difference between revisions of "Felicity Tablebases"
(Created page with "'''Home * Knowledge * Endgame Tablebases * Felicity Tablebases''' '''Felicity Tablebases''',<br/> are open source endgame tablebases in C++ for che...") |
(→License) |
||
Line 3: | Line 3: | ||
'''Felicity Tablebases''',<br/> | '''Felicity Tablebases''',<br/> | ||
are open source endgame tablebases in C++ for chess, [[Chinese Chess|Xiangqi]] and [[Jeiqi]] developed by [[Pham Hong Nguyen|Nguyen Pham]], providing some popular metrics such as [[Endgame Tablebases#DTM|depth to mate]] and [[Endgame Tablebases#DTC|depth to convert]] information. First published in 2018, it supported only Xiangqi at that time and it used a special compression algorithm to create and run with a very small-size EGTB. In April 2024, Nguyen Pham restarted the project, rewrote the whole code, added the generator, and supported chess, Xiangqi and Jeiqi. | are open source endgame tablebases in C++ for chess, [[Chinese Chess|Xiangqi]] and [[Jeiqi]] developed by [[Pham Hong Nguyen|Nguyen Pham]], providing some popular metrics such as [[Endgame Tablebases#DTM|depth to mate]] and [[Endgame Tablebases#DTC|depth to convert]] information. First published in 2018, it supported only Xiangqi at that time and it used a special compression algorithm to create and run with a very small-size EGTB. In April 2024, Nguyen Pham restarted the project, rewrote the whole code, added the generator, and supported chess, Xiangqi and Jeiqi. | ||
+ | =Progress reports= | ||
+ | Felicity is a project for studying/researching but not a ready-use one. It is not fixed to specific things such as metrics, board presentations, algorithms for compressing, or backward/forward generators. Instead, it will test as much as possible with them to find the best ones. Not every attempt/work is successful. The project creates some reports on forums to report all attempts and works. | ||
+ | |||
=License= | =License= | ||
− | It is an | + | It is an open-source, published with an MIT license. |
=See also= | =See also= |
Revision as of 14:37, 28 June 2024
Home * Knowledge * Endgame Tablebases * Felicity Tablebases
Felicity Tablebases,
are open source endgame tablebases in C++ for chess, Xiangqi and Jeiqi developed by Nguyen Pham, providing some popular metrics such as depth to mate and depth to convert information. First published in 2018, it supported only Xiangqi at that time and it used a special compression algorithm to create and run with a very small-size EGTB. In April 2024, Nguyen Pham restarted the project, rewrote the whole code, added the generator, and supported chess, Xiangqi and Jeiqi.
Progress reports
Felicity is a project for studying/researching but not a ready-use one. It is not fixed to specific things such as metrics, board presentations, algorithms for compressing, or backward/forward generators. Instead, it will test as much as possible with them to find the best ones. Not every attempt/work is successful. The project creates some reports on forums to report all attempts and works.
License
It is an open-source, published with an MIT license.
See also
- Bitbases
- Edwards' Tablebases
- Gaviota Tablebases
- Lomonosov Tablebases
- Nalimov Tablebases
- Scorpio Bitbases
- Syzygy Bases
- Thompson's Databases
Forum Posts
- A new design for Xianqgi (Chinese Chess) Endgame Tablebase by Nguyen Pham, CCC, January 16, 2018
- Progress reports by Nguyen Pham, April 16, 2024
- Felicity EGTB generators and probers by Nguyen Pham, CCC, April 20, 2024
External Links
- GitHub - nguyenpham/FelicityEgtb by [[[Pham Hong Nguyen|Nguyen Pham]]