Skip to content

Fix n-queens problem #12583

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
merged 6 commits into from
Feb 22, 2025
Merged

Fix n-queens problem #12583

Changes from 2 commits
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
2677377
Fix n-queues problem
infrablue1 Feb 18, 2025
86900e9
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Feb 18, 2025
d0986a4
Update n_queens.py
MaximSmolskiy Feb 20, 2025
b3a9693
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Feb 20, 2025
30a844a
Update n_queens.py
MaximSmolskiy Feb 20, 2025
bb3b48f
Update n_queens.py
MaximSmolskiy Feb 20, 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
5 changes: 3 additions & 2 deletions backtracking/n_queens.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -40,8 +40,9 @@ def is_safe(board: list[list[int]], row: int, column: int) -> bool:
and all(
board[i][j] != 1 for i, j in zip(range(row, -1, -1), range(column, -1, -1))
)
and all(board[i][j] != 1 for i, j in zip(range(row, n), range(column, n)))
and all(board[i][j] != 1 for i, j in zip(range(row, n), range(column, -1, -1)))
and all(
board[i][j] != 1 for i, j in zip(range(row, -1, -1), [column] * (row + 1))
)
)


Expand Down