algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2026-03-13 09:50:19 +08:00
Code Issues Packages Projects Releases Wiki Activity

Create codespell.yml (#1698)

Browse Source 
* fixup! Format Python code with psf/black push

* Create codespell.yml

* fixup! Format Python code with psf/black push
This commit is contained in:
Christian Clauss
2020-01-18 13:24:33 +01:00
committed by GitHub
parent c01d178798
commit bfcb95b297
78 changed files with 206 additions and 188 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
backtracking/n_queens.py
View File

@@ -40,8 +40,8 @@ def isSafe(board, row, column):
def solve(board, row):
"""
It creates a state space tree and calls the safe function untill it receives a
False Boolean and terminates that brach and backtracks to the next
It creates a state space tree and calls the safe function until it receives a
False Boolean and terminates that branch and backtracks to the next
poosible solution branch.
"""
if row >= len(board):
@@ -58,7 +58,7 @@ def solve(board, row):
"""
For every row it iterates through each column to check if it is feesible to place a
queen there.
If all the combinations for that particaular branch are successfull the board is
If all the combinations for that particular branch are successful the board is
reinitialized for the next possible combination.
"""
if isSafe(board, row, i):
@@ -70,7 +70,7 @@ def solve(board, row):
def printboard(board):
"""
Prints the boards that have a successfull combination.
Prints the boards that have a successful combination.
"""
for i in range(len(board)):
for j in range(len(board)):