Backtracking is a class of algorithms used to find solutions to computational problems, such as the eight queens puzzle. It builds partial candidates and abandons them if they cannot be completed to a valid solution. It is often much faster than brute-force enumeration and is the basis of logic programming languages. The term was coined by D. H. Lehmer in the 1950s.
Stanford University
Winter 2023
This course helps transition from coding to problem-solving using computers. The course explores techniques, tools, and models for problem-solving across disciplines using C++. Prior programming experience is assumed.
No concepts data
+ 33 more concepts