(0,7) (1,7) (2,7) (3,7) (4,7) (5,7) (6,7) (7,7) (0,6) ... ... ... ... ... (6,6) (7,6) ... ... ... ... ... ... ... ... (0,1) (1,1) ... ... ... ... ... (7,1) (0,0) (1,0) (2,0) (3,0) (4,0) (5,0) (6,0) (7,0)We give the paths as a sequence of ordered pairs, indicating that the actor in question visited those intersections in that order.
The paths are:
Actor 1 : (1,1), (2,1), (2,2), (2,3), (3,3), (4,3), (3,3), (2,3), (1,3),
(2,3), (3,3), (4,3), (5,3), (5,4), (5,5), (5,6), (6,6)
Actor 2 : (1,1), (1,0), (1,1), (2,1), (3,1), (3,2), (3,1), (3,2), (3,3),
(3,4), (3,5), (3,6), (4,6), (5,6), (6,6)
Actor 3 : (1,1), (1,0), (1,1), (2,1), (3,1), (4,1), (5,1), (6,1), (6,2),
(6,3), (6,4), (6,5), (6,6)
Actor 4 : (1,1), (1,0), (2,0), (3,0), (4,0), (4,1), (4,2), (4,3), (4,4),
(4,5), (4,6), (5,6), (6,6)
Actor 5 : (1,1), (2,1), (2,2), (3,2), (3,3), (4,3), (5,3), (5,4), (5,5),
(4,5), (5,5), (6,5), (6,6)
Actor 6 : (1,1), (1,0), (2,0), (3,0), (4,0), (3,0), (4,0), (4,1), (4,2),
(5,2), (5,3), (5,4), (5,5), (5,6), (6,6)
Actor 7 : (1,1), (2,1), (2,2), (3,2), (4,2), (5,2), (4,2), (5,2),
(5,3), (5,4), (5,5), (5,6), (6,6)
Actor 8 : (1,1), (1,0), (2,0), (3,0), (4,0), (3,0), (4,0), (4,1), (4,2),
(5,2), (5,3), (5,4), (5,5), (5,6), (6,6)