a1 a2 b2 a3 b3 c3 a4 b4 c4 d4 a5 b5 c5 d5 e5 a6 b6 c6 d6 e6 f6
Square lattice representation and board notation.
(0,0) hole in bold.
Normal representation with board notation.
Green holes are starting/finishing locations along the center line. Red holes are starting/finishing locations off the center line. We can vacate any green or red hole, and (potentially) finish in any other green or red hole. All such problems constitute every possible single vacancy to single survivor problem (solvable by considering the fundamental classes). Problems are grouped by the color of the finishing hole.
 21 Hole Triangular Board [Preliminary results] 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, Second longest, Final) [Comment] 1 (0,0) a1 (0,0) a1 10 (S) 87 7 7 4 11 1(7,3,7), 2(7,3,3), 1(7,2,7), 10(6,3,6), 5(6,3,3), 1(5,5,5), 9(5,4,5), 6(5,4,4), etc. 2 (1,-2) b3 (0,0) a1 10 (S) 46 5 5 4 9 2(5,4,5), 4(5,4,4), 1(5,3,5), 5(5,3,2), 20(4,4,4), 10(4,3,4), 4(4,3,2) 3 (0,-3) a4 (0,0) a1 9 12 7 7 4 6 2(7,3,7), 1(7,3,3), 3(5,4,4), 2(4,4,4), 2(4,3,4), 2(4,3,2) 4 (2,-4) c5 (0,0) a1 9 (S) 35 9 9 4 17 1(9,3,9), 1(9,2,9), 2(6,5,6), 3(6,4,6), 7(6,3,6), 1(5,5,5), 4(5,4,5), 12(4,4,4), 5 (1,-5) b6 (0,0) a1 9 2 4 4 4 1 2(4,4,4) 6 (0,0) a1 (1,-2) b3 11 (S) 101 6 2 3 4 2(6,3,1), 3(6,2,1), 1(5,4,1), 1(5,3,2), 3(5,3,1), 2(5,2,2), 5(4,4,1), 8(4,3,2), etc. 7 (1,-2) b3 (1,-2) b3 11 (S) 78 6 2 3 2 2(6,4,1), 1(6,3,1), 1(5,3,2), 11(5,3,1), 2(5,2,2), 5(5,2,1), 3(4,4,2), 2(4,4,1), etc. 8 (0,-3) a4 (1,-2) b3 10 9 (2,-4) c5 (1,-2) b3 10 (S) 10 (1,-5) b6 (1,-2) b3 10 11 (0,0) a1 (2,-4) c5 10 (S) 67 8 6 3 14 1(8,2,2), 1(7,4,4), 1(7,3,2), 2(7,2,2), 4(6,4,4), 6(6,3,6), 2(6,3,2), etc. 12 (1,-2) b3 (2,-4) c5 10 (S) 57 6 5 3 24 2(6,3,3), 2(5,5,5), 2(5,4,5), 7(5,4,4), 3(5,4,2), 15(5,3,5), 1(5,3,2), etc. 13 (0,-3) a4 (2,-4) c5 9 16 8 8 4 9 2(8,3,8), 1(8,2,8), 1(8,2,2), 1(6,5,6), 1(5,5,5), 3(5,4,5), 1(5,4,4), etc. 14 (2,-4) c5 (2,-4) c5 9 (S) 27 7 5 3 16 2(7,4,4), 2(6,5,2), 4(6,4,4), 4(6,3,3), 6(5,5,5), 12(5,4,5), 4(5,4,4), etc. 15 (1,-5) b6 (2,-4) c5 9 102 6 5 3 10 2(6,4,2), 10(6,3,2), 6(6,2,2), 2(5,5,2), 4(5,4,5), 6(5,4,4), 2(5,4,2), etc. 16 (0,0) a1 (0,-3) a4 10 167 7 7 3 21 1(7,3,7), 5(7,3,3), 2(7,2,7), 3(6,4,6), 1(6,4,4), 3(6,3,6), 14(6,3,3), etc. 17 (1,-2) b3 (0,-3) a4 10 101 7 7 3 17 2(7,3,7), 2(7,2,7), 2(6,4,6), 1(6,4,2), 4(6,3,6), 3(6,2,6), 2(5,4,5), etc. 18 (0,-3) a4 (0,-3) a4 9 9 6 6 4 3 1(6,5,6), 1(6,4,6), 1(5,4,5), 2(5,4,3), 1(5,3,3), 2(4,4,3), 1(4,3,3) 19 (3,-3) d4 (0,-3) a4 9 25 7 5 4 8 1(7,3,3), 1(6,5,1), 2(6,4,1), 2(6,3,1), 2(5,4,5), 1(5,4,4), 1(5,4,1), etc. 20 (2,-4) c5 (0,-3) a4 9 67 8 8 3 14 2(8,3,8), 2(8,2,8), 2(7,3,7), 1(6,4,6), 1(6,4,3), 8(6,3,6), 2(6,3,3), etc. 21 (1,-5) b6 (0,-3) a4 9 37 7 6 4 8 2(7,4,4), 5(6,4,6), 7(6,3,6), 3(5,5,5), 8(5,4,5), 2(5,4,4), 4(5,3,5), 5(4,4,4), 1(4,3,4) 22 (4,-5) e6 (0,-3) a4 9 37 7 6 4 8 Same as #21 23 (0,0) a1 (1,-5) b6 10 166 7 7 3 26 1(7,3,7), 1(7,2,7), 4(6,4,6), 1(6,4,4), 3(6,3,6), 2(6,3,3), 2(6,2,6), etc. 24 (1,-2) b3 (1,-5) b6 10 85 7 7 3 20 1(7,4,7), 1(7,3,7), 1(6,5,5), 9(6,3,6), 6(6,2,6), 2(5,4,5), 3(5,4,4), etc 25 (0,-3) a4 (1,-5) b6 9 22 7 6 4 7 1(7,3,3), 3(6,3,6), 2(6,3,3), 5(5,3,3), 6(4,4,4), 2(4,4,3), 3(4,3,3) 26 (3,-3) d4 (1,-5) b6 9 3 5 5 5 2 1(5,4,5), 1(5,4,4), 1(5,3,5) 27 (2,-4) c5 (1,-5) b6 9 119 6 6 4 21 4(6,5,6), 2(6,4,6), 2(6,4,4), 1(6,4,3), 19(6,3,6), 2(6,2,6), 7(5,5,5), etc. 28 (1,-5) b6 (1,-5) b6 9 20 7 7 5 6 6(7,3,7), 3(6,4,4), 4(6,3,6), 2(6,3,3), 1(5,5,5), 2(5,4,4), 2(5,3,3) 29 (4,-5) e6 (1,-5) b6 9 20 7 7 5 6 Same as #28 Total: 1508 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, Second Longest, Eg. 12(8,7,2) indicates there are 12 solutions with different move sequences, where , Final) the longest sweep is 8, the second longest sweep is 7, and the final sweep is 2 (S) Problem is symmetric, multiple solutions counted as one Solution differences can be very subtle. Download a zip file with all XXXX solutions