Skip to content
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

Jump to bottom

Refactored N-Queens problem #848

Merged
merged 6 commits into from
Mar 15, 2018
Merged

Refactored N-Queens problem #848

Changes from 1 commit
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
1e39ee9
NQueensProblem returns tuples as states
ad71 Mar 15, 2018
238c2ae
Reran search.ipynb
ad71 Mar 15, 2018
4ab8afa
List to tuple
ad71 Mar 15, 2018
0160556
Changed default value and add heuristic function
ad71 Mar 15, 2018
de15f0a
Added astar_search for NQueensProblem
ad71 Mar 15, 2018
5e6823e
Added tests for NQueensProblem
ad71 Mar 15, 2018
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
Prev Previous commit
Next Next commit
List to tuple
  • Loading branch information
@ad71
ad71 committed Mar 15, 2018
commit 4ab8afa5045f66b6869b43bb1cd94c312bae5d72
2 changes: 1 addition & 1 deletion search.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1123,7 +1123,7 @@ class NQueensProblem(Problem):
row r, and a value of None means that the c-th column has not been
filled in yet. We fill in columns left to right.
>>> depth_first_tree_search(NQueensProblem(8))
<Node [7, 3, 0, 2, 5, 1, 6, 4]>
<Node (7, 3, 0, 2, 5, 1, 6, 4)>
"""

def __init__(self, N):
Expand Down