refactored

Initial Commit for depth first, A* and MENACE

Initial Commit for depth first, A* and MENACEw

touch ups

touch ups

Queens problem, solved. Does not look pretty. Successor, is allowed and is goal completed. Breadth first function still not touched

touch up

touch up

breadth first algorithm untouched. Sudoku Successors and allowed moves completed. Tested with solution testing.py. Sudoku is_goal also completed

first commit breadth first search, algorithm done. tested with Maze problem

first commit breadth first search, algorithm done. Is_goal and Successors is jst skeleton code

Exercise 4.9 question 4 done

still requires optimization for space usage and speed. Memoizing might be a good Idea!

Exercise 4.9 question 4 done

still requires optimization for space usage and speed. Memoizing might be a good Idea!

Exercise 4.9 question 4 done

still requires optimization for space usage and speed. Memoizing might be a good Idea!

Exercise 4.9 question 3 done.

Optimised and removed a lot of un-needed code. Might still need to use Dijkstra’s Algorithm

Exercise 4.9 question 3 done.

Works okay for smaller grids but is a lot slower for larger grids. Might be worthwhile to use Dijkstra’s Algorithm

Exercise 4.9 question 2 done.
the files are split as the code snippets are considerably longer

Question 1 corrected
Question 4 was incorrect. removed it.
Question 5 done.
Question 6 done.

answer 4 was incorrect. removed it.
Question 5 done.

question 1 corrected and question 4 completed

question 1 corrected and question 4 completed

question 1 complete

question 1 complete