Solving the N Queens Problem using a variety of methods including backtracking, various hill climb algorithms and the min-conflicts heuristic for CSPs
- Recursive backtracking
- Steepest ascent hill climb
- Line beam search
- Simulated Annealing
- Minimum conflicts heurstic for solving CSPs