CPSC 110 Lecture Notes - Lecture 19: Backtracking

94 views3 pages
Verified Note
8 Nov 2018
School
Course
Professor

Document Summary

;; in this problem you will design a program to check whether a given simple. Note that you are operating on very simple mazes: ;; - all of your mazes will be square. ;; - all mazes start in the upper left corner and end in the lower right corner. ;; - at each move, you can only move down or right. ;; design a representation for mazes, and then design a function that consumes. ;; a maze and produces true if the maze is solvable, false otherwise. ;; solvable means that it is possible to start at the upper left, and make it. Your final path can only move down or right one square. But, it is permissible to backtrack if you reach a dead end. ;; for example, the first three mazes below are solvable. ;; is not solvable because it would require moving left. ;; need to support moving down and right!

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

Related Questions