Backtracking using the checkers problem as an example

In chess, the queen is the only piece that can move freely horizontally, vertically, and diagonally. The k-queens problem involves placing k queens on a k x k chessboard so that they do not obstruct each other, meaning no two queens are ever in the same rank, column, or diagonal. Solutions to the k-queens problem can be found using an exhaustive search. It is helpful to place one queen at a time on the board. If you get stuck, you have to remove previously placed queens. This is called "backtracking." 00:00 - Intro 00:19 - Introduction 03:17 - Example for k = 4 04:12 - How do you count everything? 06:22 - Algorithm 13:05 - Algorithm with Backtracking 15:56 - What does "backtracking" mean? 16:19 - Example for k = 7 Exhaustive search:    • Rucksackproblem: Erschöpfende Suche