Dynamic program to solve Hanabi endgame optimally (assuming people know their cards but not the draw pile)

Maximilian Keßler d95f40e2ae normalize positions if duplicates of cards have already been played		2023-08-08 16:27:25 +02:00
.gitignore	add submodule and proper .gitignore	2023-08-08 11:12:59 +02:00
.gitmodules	move submodule	2023-08-08 11:14:32 +02:00
CMakeLists.txt	normalize positions if duplicates of cards have already been played	2023-08-08 16:27:25 +02:00
download.h	implement tablebase	2023-08-08 00:29:19 +02:00
game_state.h	normalize positions if duplicates of cards have already been played	2023-08-08 16:27:25 +02:00
game_state.hpp	normalize positions if duplicates of cards have already been played	2023-08-08 16:27:25 +02:00
main.cpp	normalize positions if duplicates of cards have already been played	2023-08-08 16:27:25 +02:00
myassert.h	add missing assert file	2023-08-06 22:08:34 +02:00