Backtracking is an algorithm that solves problems recursively by building candidates for a solution incrementally and abandoning a candidate as soon as it cannot satisfy the constraints.
The N-queens puzzle is the problem of placing N chess queens on an n×n chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal.
Video.-.Depuracao.por.Backtracking.mp4
Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
Please make sure to update tests as appropriate.
- Saullo Bretas - saullo
- Daniel Aquino - aquin0
- Hugo Poletto - HugoPoletto34
- Isabel Matos - isabelpmatos
- Pedro Belo - PedroBelo1550