Hanabi/Py-Hanabi
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

adapt game checking code to new HanabLiveInstance

Browse source
This commit is contained in:
Maximilian Keßler 2023-05-13 18:26:06 +02:00
parent b7f6df7e0d
commit 76d585e656
Signed by: max
GPG key ID: BCC5A619923C0BA5
1 changed files with 7 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
check_game.py
View file

@ -3,7 +3,8 @@ from typing import Tuple, Optional
from database import conn
from compress import decompress_deck, decompress_actions, compress_actions, link
from hanabi import Action, HanabiInstance, GameState
from hanabi import Action, GameState
from hanab_live import HanabLiveInstance, HanabLiveGameState
from sat import solve_sat
from download_data import export_game
@ -25,7 +26,7 @@ def check_game(game_id: int) -> Tuple[int, GameState]:
deck = decompress_deck(compressed_deck)
actions = decompress_actions(compressed_actions)
instance = HanabiInstance(deck, num_players, variant_id=variant_id)
instance = HanabLiveInstance(deck, num_players, variant_id=variant_id)
if instance.max_score == score:
# instance has been won, nothing to compute here
@ -36,12 +37,12 @@ def check_game(game_id: int) -> Tuple[int, GameState]:
unsolvable_turn = len(actions)
# first, check if the instance itself is feasible:
game = GameState(instance)
game = HanabLiveGameState(instance)
solvable, solution = solve_sat(game)
if not solvable:
return 0, solution
while (unsolvable_turn - solvable_turn > 1):
while unsolvable_turn - solvable_turn > 1:
try_turn = (unsolvable_turn + solvable_turn) // 2
try_game = copy.deepcopy(game)
assert(len(try_game.actions) == solvable_turn)
@ -58,8 +59,9 @@ def check_game(game_id: int) -> Tuple[int, GameState]:
assert(unsolvable_turn - 1 == solvable_turn)
return unsolvable_turn, solution
if __name__ == "__main__":
game_id = 963339
game_id = 921269
export_game(game_id)
print("checking game {}".format(game_id))
turn, sol = check_game(game_id)