Skip to content

Implement solver #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
DenHvideDvaerg merged 5 commits into from
Sep 2, 2025
Merged

Implement solver #2

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
d10177f
Implement SnakeSolver
DenHvideDvaerg Sep 2, 2025
2de0c23
Enhance board visualization with dynamic column and row sum alignment
DenHvideDvaerg Sep 2, 2025
6519604
Cleanup SnakeSolver
DenHvideDvaerg Sep 2, 2025
b953417
Update unittests
DenHvideDvaerg Sep 2, 2025
7f04f52
polish
DenHvideDvaerg Sep 2, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
151 changes: 88 additions & 63 deletions main.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,17 @@
import time


def example_3x3():
"""Simple 3x3 example for testing"""
puzzle = SnakePuzzle(
row_sums=[2, 1, 2],
col_sums=[1, 3, 1],
start_cell=(0, 0),
end_cell=(2, 2)
)
return puzzle


def example_8x8():
"""8x8 example from https://puzzlegenius.org/snake/"""
puzzle = SnakePuzzle(
Expand All @@ -13,75 +24,89 @@ def example_8x8():
return puzzle


def main():
"""
Example usage of the Snake solver.
def example_diagonal_touching():
"""Diagonal touching example (infeasible)"""
puzzle = SnakePuzzle(
row_sums=[2, 3, 3, 0, 0],
col_sums=[0, 3, 2, 2, 1],
start_cell=(0, 2),
end_cell=(1, 4)
)
return puzzle

def example_adjacent_touching():
"""Adjacent touching example (infeasible)"""
puzzle = SnakePuzzle(
row_sums=[1, 4, 3, 0],
col_sums=[3, 2, 1, 2],
start_cell=(0, 0),
end_cell=(3, 3)
)
return puzzle

def example_12x12_evil():
"""12x12 'Evil' puzzle from https://gridpuzzle.com/snake/evil-12"""
puzzle = SnakePuzzle(
row_sums=[11, 2, 7, 4, 4, None, None, None, 3, 2, None, 5],
col_sums=[9, 7, None, 2, 5, 6, None, None, 5, None, None, None],
start_cell=(2, 6),
end_cell=(7, 5)
)
return puzzle

def solve_puzzle(puzzle, name):
"""Solve a snake puzzle and display results"""
print(f"\n" + "="*60)
print(f"SOLVING {name.upper()}")
print("="*60)

"""
print("Snake MIP Solver - Example Usage")
print("=" * 50)
# Create and use the solver
solver = SnakeSolver(puzzle)


try:
puzzle = example_8x8()
print(f"Created puzzle: {puzzle}")

# Create solver
solver = SnakeSolver(puzzle)
print("Solver initialized successfully")
print("Solver information:")
info = solver.get_solver_info()
for key, value in info.items():
print(f" {key}: {value}")

print("\nSolving...")
start_time = time.time()
solution = solver.solve(verbose=False)
solve_time = time.time() - start_time

if solution:
print(f"\nSolution found in {solve_time:.3f} seconds!")
print(f"Solution has {len(solution)} filled cells")
print(f"Solution: {sorted(list(solution))}")

# Solve the puzzle
print("\nSolving puzzle...")
start_time = time.time()
solution = solver.solve(verbose=True)
solve_time = time.time() - start_time
# Display the board with solution
print("\nPuzzle with solution:")
print(puzzle.get_board_visualization(solution, show_indices=True))

# Display results
if solution is not None:
print(f"\n✅ Solution found in {solve_time:.3f} seconds!")
print(f"Solution: {solution}")
print(puzzle.get_board_visualization())

manual_solution = set()
manual_solution.add((2, 5))
manual_solution.add((1, 5))
manual_solution.add((0, 5))
manual_solution.add((0, 4))
manual_solution.add((0, 3))
manual_solution.add((0, 2))
manual_solution.add((1, 2))
manual_solution.add((2, 2))
manual_solution.add((3, 2))
manual_solution.add((3, 1))
manual_solution.add((3, 0))
manual_solution.add((4, 0))
manual_solution.add((5, 0))
manual_solution.add((5, 1))
manual_solution.add((5, 2))
manual_solution.add((6, 2))
manual_solution.add((7, 2))
manual_solution.add((7, 3))
manual_solution.add((7, 4))
manual_solution.add((7, 5))
manual_solution.add((7, 6))
manual_solution.add((7, 7))
manual_solution.add((6, 7))
print(puzzle.get_board_visualization(manual_solution, show_indices=True))
print(f"Manual solution valid? {puzzle.is_valid_solution(manual_solution)}")
# TODO: Add solution visualization or validation
# Example:
# if puzzle.is_valid_solution(solution):
# print("Solution is valid!")
# display_solution(puzzle, solution)
# else:
# print("Solution validation failed!")
# Validate solution
if puzzle.is_valid_solution(solution):
print("✅ Solution is valid!")
else:
print(f"\nNo solution found (took {solve_time:.3f} seconds)")

except Exception as e:
print(f"Error: {e}")
print("Make sure to implement your puzzle class and solver logic!")
print("❌ Solution validation failed!")
else:
print(f"\nNo solution found (took {solve_time:.3f} seconds)")


def main():
# Solve different puzzle examples
puzzle_3x3 = example_3x3()
solve_puzzle(puzzle_3x3, "3x3 Simple")

puzzle_diag = example_diagonal_touching()
solve_puzzle(puzzle_diag, "5x5 Diagonal Touching")

puzzle_adjacent_touching = example_adjacent_touching()
solve_puzzle(puzzle_adjacent_touching, "4x4 Adjacent Touching")

puzzle_8x8 = example_8x8()
solve_puzzle(puzzle_8x8, "8x8")

puzzle_12x12 = example_12x12_evil()
solve_puzzle(puzzle_12x12, "12x12 Evil")

if __name__ == "__main__":
main()
38 changes: 29 additions & 9 deletions snake_mip_solver/puzzle.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -288,13 +288,28 @@ def get_board_visualization(self, snake_positions: Optional[Set[Tuple[int, int]]
snake_positions = snake_positions or set()
lines = []

# Calculate the maximum width needed for row sums to ensure proper alignment
max_row_sum_width = max(
len(str(s)) if s is not None else 1
for s in self.row_sums
)

# Calculate the maximum width needed for column indices if shown
max_col_index_width = len(str(self.cols - 1)) if show_indices else 0

# Header with column indices and sums
if show_indices:
header = " " + " ".join(str(i) for i in range(self.cols))
# Row index + row sum padding + space
prefix_width = max_col_index_width + max_row_sum_width + 2
header = " " * prefix_width + " ".join(f"{i:>{max_col_index_width}}" for i in range(self.cols))
lines.append(header)
col_sums_line = " " + " ".join(str(s) if s is not None else "?" for s in self.col_sums)
col_sums_line = " " * prefix_width + " ".join(
f"{str(s) if s is not None else '?':>{max_col_index_width}}" for s in self.col_sums
)
else:
col_sums_line = " " + " ".join(str(s) if s is not None else "?" for s in self.col_sums)
# Just row sum padding + space
prefix_width = max_row_sum_width + 1
col_sums_line = " " * prefix_width + " ".join(str(s) if s is not None else "?" for s in self.col_sums)

lines.append(col_sums_line)

Expand All @@ -303,21 +318,26 @@ def get_board_visualization(self, snake_positions: Optional[Set[Tuple[int, int]]
row_parts = []

if show_indices:
row_parts.append(str(row))
row_parts.append(f"{row:>{max_col_index_width}}")

row_sum_str = str(self.row_sums[row]) if self.row_sums[row] is not None else "?"
row_parts.append(row_sum_str)
row_parts.append(f"{row_sum_str:>{max_row_sum_width}}")

for col in range(self.cols):
pos = (row, col)
if pos == self.start_cell:
row_parts.append('S')
cell_str = 'S'
elif pos == self.end_cell:
row_parts.append('E')
cell_str = 'E'
elif pos in snake_positions:
row_parts.append('x') # █
cell_str = 'x'
else:
cell_str = '_'

if show_indices:
row_parts.append(f"{cell_str:>{max_col_index_width}}")
else:
row_parts.append('_')
row_parts.append(cell_str)

lines.append(' '.join(row_parts))

Expand Down
Loading