def test_PSOLB_random(self):
"""
Check if solution computed by PSOL + edge removal is included in the full solution computed by
Zielonka's algorithm.
"""
print("test psolb random")
not_solved_size = []
for i in range(5, self.number_of_random + 5):
g = gen.random(i, i / 2, 1, i / 3)
winning_region_0, winning_region_1 = zielonka.strong_parity_solver_no_strategies(
g)
resulting_arena, fatal_region_0, fatal_region_1 = fatal.psolB(
g, [], [])
self.assertTrue(elem in winning_region_0
for elem in fatal_region_0)
self.assertTrue(elem in winning_region_1
for elem in fatal_region_1)
# if the game is completely solved by PSOL
if set(winning_region_0) == set(fatal_region_0) and set(
winning_region_1) == set(fatal_region_1):
self.fully_solved_random += 1
else:
not_solved_size.append(i)
print("Number of random games fully solved by PSOLB = " +
str(self.fully_solved_random))
print("Size of games not solved = " + str(not_solved_size) + "\n")
def test_PSOLB_paper_example(self):
"""
Check if solution computed by PSOLB is correct on an example provided in the paper 'Fatal Attractors in Parity
Games: Building Blocks for Partial Solvers'. Note : priorities were inversed since we work with max parity
and the paper works with min parity.
"""
print("test psolb paper example")
g = io.load_from_file("examples/fatal_attractors_paper_example.txt")
winning_region_0, winning_region_1 = zielonka.strong_parity_solver_no_strategies(
g)
resulting_arena, fatal_region_0, fatal_region_1 = fatal.psolB(
g, [], [])
expected_region_0, expected_region_1 = {2, 4, 6, 8, 0, 1, 9, 10,
11}, set()
should_remain = {3, 5, 7}
self.assertTrue(elem in winning_region_0 for elem in fatal_region_0)
self.assertTrue(elem in winning_region_1 for elem in fatal_region_1)
self.assertTrue(should_remain == set(resulting_arena.get_nodes()))
self.assertTrue(expected_region_0 == set(fatal_region_0))
self.assertTrue(expected_region_1 == set(fatal_region_1))
def test_recursive_single_priority_random(self):
"""
Check if solution computed by the recursive algorithm is correct.
We create random parity games and transform them into generalized parity games by using a copy of the first
priority function as a second priority function.
"""
print("test recursive single priority random")
for i in range(5, self.number_of_random + 5):
g = gen.random(i, i / 2, 1, i / 3)
winning_region_0, winning_region_1 = zielonka.strong_parity_solver_no_strategies(
g)
computed_winning_0, computed_winning_1 = recursive.generalized_parity_solver(
g)
self.assertTrue(set(winning_region_0) == set(computed_winning_0))
self.assertTrue(set(winning_region_1) == set(computed_winning_1))
def test_PSOL_worstcase(self):
"""
Check if solution computed by PSOL is included in the full solution computed by Zielonka's algorithm.
"""
print("test psol worstcase")
for i in range(self.number_of_worstcase):
g = gen.strong_parity_worst_case(i)
winning_region_0, winning_region_1 = zielonka.strong_parity_solver_no_strategies(g)
resulting_arena, fatal_region_0, fatal_region_1 = fatal.psol(g, [], [])
self.assertTrue(elem in winning_region_0 for elem in fatal_region_0)
self.assertTrue(elem in winning_region_1 for elem in fatal_region_1)
# if the game is completely solved by PSOL
if set(winning_region_0) == set(fatal_region_0) and set(winning_region_1) == set(fatal_region_1):
self.fully_solved_worstcase += 1
print("Number of worst case games fully solved by PSOL = " + str(self.fully_solved_worstcase) + "\n")
def test_PSOL_edge_removal_ladder(self):
"""
Check if solution computed by PSOL + edge removal is included in the full solution computed by Zielonka's
algorithm.
"""
print("test psol edge removal ladder")
for i in range(self.number_of_ladder):
g = gen.ladder(i)
winning_region_0, winning_region_1 = zielonka.strong_parity_solver_no_strategies(g)
resulting_arena, fatal_region_0, fatal_region_1 = fatal.psol_edge_removal(g, [], [])
self.assertTrue(elem in winning_region_0 for elem in fatal_region_0)
self.assertTrue(elem in winning_region_1 for elem in fatal_region_1)
# if the game is completely solved by PSOL
if set(winning_region_0) == set(fatal_region_0) and set(winning_region_1) == set(fatal_region_1):
self.er_fully_solved_ladder += 1
print("Number of ladder games fully solved by PSOL with edge removal = " + str(
self.er_fully_solved_ladder) + "\n")