Skip to content

Latest commit

 

History

History
18 lines (11 loc) · 334 Bytes

README.md

File metadata and controls

18 lines (11 loc) · 334 Bytes

vacuum-graph

Problem

We are given a room with debris and need to find the least possible moves until the room is clean.

Possible Moves include Left, Right, Up, Down, and Suck.

Solution

This problem uses various tree walks.

Solutions Used

  • A Star
  • Breath First Search
  • Iterative Deepening Search
  • Depth First Search