This document discusses the N Queen problem, where the goal is to place N queens on an N×N chessboard so that no two queens attack each other. Backtracking is an algorithmic technique for solving problems recursively by trying to build a solution incrementally, abandoning a solution ("backtracking") as soon as it is determined that the solution cannot possibly be completed to a valid one. The document likely provides an explanation and example of using a backtracking algorithm to solve the N Queen problem.

1. BET_ADA_6_Textbook_BackTracking - N Queen
Friday, January 14, 2022 8:58 AM
General Page 1

2. General Page 2