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.

This problem uses various tree walks.

Solutions Used

Name		Name	Last commit message	Last commit date
Latest commit History 45 Commits
result		result
test		test
README.md		README.md
problem21_1.py		problem21_1.py
problem21_2.py		problem21_2.py
problem21_3.py		problem21_3.py
problem21_4.py		problem21_4.py
problem21_5.py		problem21_5.py
problem21_6.py		problem21_6.py
problem22_1.py		problem22_1.py
problem22_2.py		problem22_2.py
problem22_3.py		problem22_3.py
problem22_4.py		problem22_4.py
problem22_5.py		problem22_5.py
problem22_6.py		problem22_6.py
problem23_1.py		problem23_1.py
problem23_2.py		problem23_2.py
problem23_3.py		problem23_3.py
problem23_4.py		problem23_4.py
problem23_5.py		problem23_5.py
problem23_6.py		problem23_6.py