Iterative Deepening Search

An implementation of pathfinding using Iterative Deepening Search a.k.a. IDS.
multiple goal maze solving

usage :
execute this code with IDS.py and input.txt ex) python IDS.py input.txt output.txt
it will generate the best path
1 means wall (can't pass)
2 means road (can pass)
3 means start node
4 means final node (it can be multiple)
5 means the best path
length means the length of best path (number of 5)
time means whole search time (how many nodes were checked)