./UninformedSearch.py puzzles/traffic01.txt 
found a solution of length 6 by expanding 91 nodes

start 
    | |
 1 2 2 - - 
 1 3 3 - - 
 1 - 0 - - 
 - - 0 - - 
 - - 0 - - 

('car1', 'down', (2, 0)) 
    | |
 - 2 2 - - 
 1 3 3 - - 
 1 - 0 - - 
 1 - 0 - - 
 - - 0 - - 

('car1', 'down', (3, 0)) 
    | |
 - 2 2 - - 
 - 3 3 - - 
 1 - 0 - - 
 1 - 0 - - 
 1 - 0 - - 

('car2', 'left', (0, 1)) 
    | |
 2 2 - - - 
 - 3 3 - - 
 1 - 0 - - 
 1 - 0 - - 
 1 - 0 - - 

('car3', 'left', (1, 1)) 
    | |
 2 2 - - - 
 3 3 - - - 
 1 - 0 - - 
 1 - 0 - - 
 1 - 0 - - 

('car0', 'up', (2, 2)) 
    | |
 2 2 - - - 
 3 3 0 - - 
 1 - 0 - - 
 1 - 0 - - 
 1 - - - - 

('car0', 'up', (1, 2)) 
    | |
 2 2 0 - - 
 3 3 0 - - 
 1 - 0 - - 
 1 - - - - 
 1 - - - -