1.8 KiB
Endgame-Analyzer
This is a dynamic program written in C++ to solve Hanabi endgames. Some optimizations are performed, but it is not particularly well-written at the moment and could also use some code cleanup.
As of now, you can run the executable with an id from a hanab.live game and a turn number (shifted by 1, since we start counting at 0 and hanab.live at 1) and the winning percentage for the corresponding game state with optimum play will be calculated.
Here, optimum play refers to the assumption that everbody knows their cards, but not the draw pile.
For example, if the output of the program is 1, then this means that even if an evil adversary is allowed to pick the next card in the deck each time a card is drawn, there is still a strategy that guarantees a win.
Compilation
The build uses CMake. Additionally, you need the following libraries:
- boost: For some faster containers and JSON parsing
- cpr: For easy requests (to download games from hanab.live
- GNU readline: For the comman-line interface Refer to the corresponding pages for installation instructions. On Linux distributions, readline is probably already installed.
Note that the libraries are all FOSS software and GPL-compatible.
Now, building the project is quite easy:
cmake -DCMAKE_BUILD_TYPE=RELEASE . // Release build recommended for performance, unless you want to develop
make // Rerun this every time you change sources
Usage
# ./endgame-analyzer (GAME_ID | GAME_FILE) TURN
where GAME_ID is a game from hanab.live and GAME_FILE is a path to a file containing the game as JSON in the hanab.live format.
License
This is GPLv3-licensed. See LICENSE for details.