December6
.pdf
School
Case Western Reserve University**We aren't endorsed by this school
Course
EECS 340
Subject
Computer Science
Date
Dec 17, 2024
Pages
2
Uploaded by ConstableOryx4785
Presentation QuestionsCSDS 310: AlgorithmsDecember 6th, 20241Problem 1You are in a maze that has loops and multiple levels (ramps, stairs, etc.), and you need to find your wayout. All you have is a piece of chalk to write on the walls or floor, and your algorithm knowledge. Your taskis to develop an efficient algorithm to get through the maze quickly. The running time of the algorithm willdetermine the amount of time you spend in the maze. You must use the chalk wisely, as it is not infinite.Please note: you do not have a map of the maze!1.1ExampleInput:•mazeis represented as a graph:ABCDEExit•Starting point: NodeA.•Limited chalk to mark nodes.Output:•Path to exit:A→B→C→Exit.1
2Problem 2There is a 3-by-3 grid, totaling nine squares. Also, there are 9 marbles that can start anywhere in the squares.Given some starting configuration of marbles, your job is to move the marbles such that only one marbleexists in each square of the grid.One ”move” allows you to move a single marble to an adjacent square(not diagonal). Devise an efficient algorithm that, given an initial configuration of marbles, determines theminimum number of moves in order to equally spread out the marbles across the grid.2.1ExampleInput:021300201Output:5Diagram:2