Backtracking

The aim of N-Queens Problem is to place N queens on an N x N chessboard, in a way so that no queen is in conflict with the others.

The code uses backtracking to solve the Constraint Satisfaction Problem (CSP) of map coloring. It checks if assigning colors to regions follows the constraint that no adjacent regions have the same color. The skills involved include algorithm design for backtracking, recursion, and solving CSP problems. The implementation uses Python.

The project finds the best spots for restaurants, avoiding placing restaurants too close together, and maximizing profit while keeping them a minimum distance apart. It uses dynamic programming to compute revenue and backtracking to select sites.

The Sudoku Solver is a little coding challenge just for fun;-)

Sudoku solver developed in C++ and python with backtracking. Coming in more languages!

Solve Sudoku puzzle using backtracking algorithm.

The goal of this project is to recreate both "TwoNeighhbours" (TN) by B. Hemkemeier and "HermitianNeighbours" (HN) by A. Schiemann in modern C++.