# This is the solution file for test_cases/q8/SLAMLogic1.test.
known_map_per_timestep: "[[[1, 1, 1, 1, 1], [1, -1, -1, -1, 1], [1, -1, -1, -1, 1], [1, -1, -1, 0, 1], [1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1], [1, -1, -1, -1, 1], [1, -1, -1, 0, 1], [1, -1, 1, 0, 1], [1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1], [1, -1, 0, 1, 1], [1, 0, 0, 0, 1], [1, -1, 1, 0, 1], [1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1], [1, 1, 0, 1, 1], [1, 0, 0, 0, 1], [1, -1, 1, 0, 1], [1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1], [1, 1, 0, 1, 1], [1, 0, 0, 0, 1], [1, -1, 1, 0, 1], [1, 1, 1, 1, 1]], [[1, 1, 1, 1, 1], [1, 1, 0, 1, 1], [1, 0, 0, 0, 1], [1, 0, 1, 0, 1], [1, 1, 1, 1, 1]]]"
possible_locations_per_timestep: "[[(3, 3)], [(2, 3)], [(2, 2)], [(1, 2)], [(2, 2)], [(2, 1)]]"