Skip to content

Latest commit

 

History

History
2 lines (2 loc) · 219 Bytes

File metadata and controls

2 lines (2 loc) · 219 Bytes

N-Queen-problem-using-hill-climbing-and-simulated-annealing-algorithm

The traditional AI problem 'N-Queen problem' is solved with both hill climbing & simulated annealing algorithm in this repository using python