[states] Add max_cycles

Prometheus3375 · Jul 17, 2024 · 1a2b860 · 1a2b860
1 parent 1b08b31
commit 1a2b860
Show file tree

Hide file tree

Showing 3 changed files with 9 additions and 0 deletions.
diff --git a/solve/states/base.py b/solve/states/base.py
@@ -95,6 +95,11 @@ class StateWithAllPositions[S: State, M: PMove]:
     """
     __slots__ = 'left', 'middle', 'right', 'moves_made'
 
+    max_cycles: int
+    """
+    The maximum number of cycles to solve states of this type.
+    """
+
     def __init__(self, /, left: S, middle: S, right: S, moves_made: tuple[M, ...] = ()) -> None:
         self.left = left
         self.middle = middle

diff --git a/solve/states/rooms.py b/solve/states/rooms.py
@@ -78,6 +78,8 @@ def pass_shape(self, shape: Shape2D, other: Self, /) -> [Self, Self]:
 class StateOfAllRooms(StateWithAllPositions[RoomState, PassMove]):
     __slots__ = ()
 
+    max_cycles = 6
+
     def next_states(self, /, is_doing_triumph: bool) -> Iterator[Self]:
         """
         Yields all possible next states.

diff --git a/solve/states/statues.py b/solve/states/statues.py
@@ -73,6 +73,8 @@ def dissect(self, shape1: Shape2D, other: Self, shape2: Shape2D, /) -> [Self, Se
 class StateOfAllStatues(StateWithAllPositions[StatueState, DissectMove]):
     __slots__ = ()
 
+    max_cycles = 3
+
     def next_states(self, /, is_doing_triumph: bool) -> Iterator[Self]:
         """
         Yields all possible next states.