70 likes | 88 Views
Explore the application design choices involving backtracking algorithms in the Maze Runner program. Understand how the N-Queens problem differs from Maze Runner and how this solution can be applied to Sudoku solvers. Reflect on recursion in problem-solving and anticipate its use in various scenarios. Keep track of project deadlines and reading assignments.
E N D
Application Design Choices Backtracking for the Maze Runner
Topics and Agenda Assessment 09 Exercise 33: nQueens Reflection
Course Progress • Project 1: Maze Runner • Project 2: Unlimited Precision Calculator • Project 3: eReader with Categories • Project 4: Sudoku Checker and Player • Project 5: Sudoku Solver • Project 6: eReader with Advanced Discussions Feature
You have 10 minutes Begin work on Assessment 09
You have 25 minutes Complete Exercise 33
Exercise Reflection How does the NQueens problem differ from the Maze Runner program in the previous exercise? How would you apply this kind of solution to a Sudoku solver? What other problems might require recursion of this sort?
Remember… Research Paper Final Draft: Due Next Class • Due by 8 p.m. via the LMS Project 5: Due on Class 38 • Due by 8 p.m. via the LMS Assessment 10: Class 36 Reading assignment: Complete by Class 34 • Data Structures: Chapter 3