./UninformedSearch.py puzzles/traffic05.txt 
found a solution of length 13 by expanding 1022 nodes

start 
    | |
 1 - 2 2 3 
 1 - 4 4 3 
 5 5 0 - - 
 - - 0 - 6 
 - - - - 6 

('car0', 'down', (3, 2)) 
    | |
 1 - 2 2 3 
 1 - 4 4 3 
 5 5 - - - 
 - - 0 - 6 
 - - 0 - 6 

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

('car4', 'left', (1, 2)) 
    | |
 1 2 2 - 3 
 1 4 4 - 3 
 5 5 - - - 
 - - 0 - 6 
 - - 0 - 6 

('car5', 'right', (2, 1)) 
    | |
 1 2 2 - 3 
 1 4 4 - 3 
 - 5 5 - - 
 - - 0 - 6 
 - - 0 - 6 

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

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

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

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

('car4', 'left', (1, 1)) 
    | |
 2 2 - - 3 
 4 4 - - 3 
 - 5 5 - - 
 1 - 0 - 6 
 1 - 0 - 6 

('car5', 'left', (2, 1)) 
    | |
 2 2 - - 3 
 4 4 - - 3 
 5 5 - - - 
 1 - 0 - 6 
 1 - 0 - 6 

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

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

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