add README
This commit is contained in:
parent
1c6792a693
commit
cf2a4a87c0
1 changed files with 11 additions and 0 deletions
11
README.md
Normal file
11
README.md
Normal file
|
@ -0,0 +1,11 @@
|
||||||
|
# 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.
|
Loading…
Reference in a new issue