Npuzzle and Nqueen solver with hill climbing and simulated annealing algorithms
you can run project by giving some arguments
- how many test do you want of problem
- what problem do you want to solve
- define n parameters (number of queens or puzzles)
- define algorithm by giving it's function name (hillClimbing or simulatedAnnealing)
- define tracing by giving true or false
Example:
python LocalSearchAlgorithms.py 10 NPuzzleProblem 8 simulatedAnnealing true
defualt execution without parameters will do 12 test for each problem and algorithms without tracing
python LocalSearchAlgorithms.py