maze01-tiny:
output,
DFS,
BFS,
Dijkstra,
A*
maze04-small:
output,
DFS,
BFS,
Dijkstra,
A*
maze05-medium:
output,
DFS,
BFS,
Dijkstra,
A*
maze10-huge:
output,
DFS,
BFS,
Dijkstra,
A*
terrain01-tiny:
output,
DFS,
BFS,
Dijkstra,
A*
terrain03-small:
output,
DFS,
BFS,
Dijkstra,
A*
terrain06-medium:
output,
DFS,
BFS,
Dijkstra,
A*
terrain07-large:
output,
DFS,
BFS,
Dijkstra,
A*
map-middleearth:
output
Rauros:
DFS,
BFS,
Dijkstra
Black Gate:
DFS,
BFS,
Dijkstra
map-stanford:
output,
DFS,
BFS,
Dijkstra
map-usa:
output
Portland/NY:
DFS,
BFS,
Dijkstra
Bismarck/CHI:
BFS
random (medium):
output,
screenshot
** The demo JAR looks for its input files in its current directory. If you get a file-not-found error, make sure you run the JAR from a directory that contains the input files.
Part A (Word Ladder): You don't need to generate exactly the same word ladder, as long as yours is the same length.
Part B (N-grams): It's hard to match the expected output exactly because it is random. But you should match the overall format, intro message, etc.
You are expected to follow the Stanford Honor Code.
Remember that we run similarity-detection software over all solutions, including this quarter and past quarters, as well as any solutions we find on the web.
If you need help solving an assignment, we are happy to help you. You can go to the LaIR, or the course message forum, or email your section leader, or visit the instructor / head TA during office hours. You can do it!
See Course Information handout for full Honor Code policies, or email us if you have any questions.