Skip to content

quickly find if a puzzle is solvable without computing all solutions #5

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

Open
pd2 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

quickly find if a puzzle is solvable without computing all solutions #5

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
4 changes: 3 additions & 1 deletion pentomino.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -154,7 +154,7 @@ def update_board(self, piece, r, c):
if piece.shape[pr][pc] != Shape.EMPTY:
self.board[r+pr][c+pc] = piece.shape[pr][pc]

def find_solutions(self):
def find_solutions(self, is_it_solvable=None):
# X-Constraints
# Board: For each of the board squares, there is the constraint that it must be
# covered by a pentomino exactly once. Name these constraints after the
Expand Down Expand Up @@ -189,6 +189,8 @@ def find_solutions(self):
for rotation, r, c in solution_keys:
solution.update(rotation, r, c)
yield solution
if is_it_solvable:
return


if __name__ == '__main__':
Expand Down