c1 d1 e1 b2 c2 d2 e2 f2 a3 b3 c3 d3 e3 f3 g3 a4 b4 c4 d4 e4 f4 g4 a5 b5 c5 d5 e5 f5 g5 b6 c6 d6 e6 f6 c7 d7 e7
 B A B C C B C C B C C B C C B A B B A B B A B C C B C C B C C B C C B A B
Standard 7x7 Notation Hole Classification
(color coding used below).
(0,0) hole in bold.

 French 37-Hole Board Single Vacancy to Single Survivor Problems # Vacate Finish at Length of Shortest Solution Number of Solutions Longest Sweep Longest Finishing Sweep Shortest Longest Sweep Number of Final Moves #(Longest Sweep, Final Sweep) [Comment] 1 (-1,3) c1 (1,3) e1 20 243 8 4 5 7 2 (-1,3) c1 (-2,0) b4 20 35 7 1 5 2 3 (-1,3) c1 (1,0) e4 20 7 8 8 4 3 4 (-1,3) c1 (1,-3) e7 20 9 7 3 5 3 5 (-1,0) c4 (1,3) e1 21 2197 9 4 4 9 6 (-1,0) c4 (-2,0) b4 21 (*) 3266 8 3 4 6 7 (-1,0) c4 (1,0) e4 21 (*) 265 8 8 4 10 8 (2,0) f4 (1,3) e1 20 667 9 4 4 14 9 (2,0) f4 (-2,0) b4 20 (*) 495 8 3 4 3 10 (2,0) f4 (1,0) e4 20 (*) 53 7 7 4 10 Column Definitions: Length of Shortest Solution This is the length of the shortest solution to this problem, minimizing total moves Number of Solutions This is the number of unique solution sequences, irregardless of move order and symmetry Longest Sweep This is the longest sweep possible in any minimal length solution [link to solution] Longest Finishing Sweep This is the longest sweep in the final move of any minimal length solution [link] Shortest Longest Sweep There is no minimal length solution where all sweeps are shorter than this number [link] Number of Final Moves This is the number of different finishing moves (up to symmetry) #(Longest Sweep Eg. 12(8,UUR) indicates there exist 12 solutions with different move sequences, , Final Sweep) where the longest sweep is 8 and the final move is the 3 sweep: UUR (*) Problem is symmetric, multiple solutions counted as one Note that solution diagrams are given for Vacate/Finish At in Cartesian Coordinates. To match locations shown in standard notation, reflection and/or reflection is generally needed. Solution differences can be very subtle.