This a story about an old robot named Tron, a garbage collector. Tron can work in environments that have empty navigable spaces in between, separated by obstacles (walls, etc.).
computer science
Description
1 Problem description
This a story about an old robot named Tron, a garbage collector. Tron can work in environments that have empty navigable spaces in between, separated by obstacles (walls, etc.). Tron has a built-in stack-based algorithm using which it can find its way to exit starting from a certain start location. For the sake of simplicity, we assume that the environment has exactly one exit. For cleaning purposes, Tron is airdropped to a certain empty location in the environment. Its job is to clean garbage on the way to exit. In our case, the environments are just m×n rectangular grids. Assume that m, n ≥ 1. This means an environment has m rows and n columns. The rows are numbered from 0 to m − 1 and the columns from 0 to n−1. In our figures, the top row is numbered 0 and the left column is numbered 0. Except for the start and the end grid cells, every grid cell is either empty or has an obstacle in it.
Instruction Files
maze2Solution.txt
105.0 Bytes
maze1Solution.txt
93.0 Bytes
maze4Solution.txt
21.0 Bytes
ExitFinder.java
2.8 KB
maze2.txt
102.0 Bytes
maze6.txt
257.0 Bytes
maze4.txt
24.0 Bytes
maze6Solution.txt
253.0 Bytes
maze5Solution.txt
15.0 Bytes
maze5.txt
205.0 Bytes
maze1.txt
63.0 Bytes
maze3Solution.txt
119.0 Bytes
maze3.txt
116.0 Bytes
HW3.pdf
465.4 KB
TestExitFinder.java
3.8 KB
