diff options
Diffstat (limited to 'src/2016/day24/README.md')
| -rw-r--r-- | src/2016/day24/README.md | 4 |
1 files changed, 4 insertions, 0 deletions
diff --git a/src/2016/day24/README.md b/src/2016/day24/README.md index f6e4d96..579acf3 100644 --- a/src/2016/day24/README.md +++ b/src/2016/day24/README.md @@ -27,3 +27,7 @@ Since the robot isn't very fast, you need to find it the shortest route. This pa Given your actual map, and starting from location 0, what is the fewest number of steps required to visit every non-0 number marked on the map at least once? +--- Part Two --- +Of course, if you leave the cleaning robot somewhere weird, someone is bound to notice. + +What is the fewest number of steps required to start at 0, visit every non-0 number marked on the map at least once, and then return to 0? |