min amd max solutions to cases n=3 to 27 n = 3 min and max 010 111 010 finish, n = 3 tot_solutions = 1 min_pushes = 5 max_pushes = 5 min_cnt= 1 max_cnt 1 n = 5 min and max 11000 00100 10110 10001 01101 finish, n = 5 tot_solutions = 4 min_pushes = 11 max_pushes = 11 min_cnt= 4 max_cnt 4 n = 7 min and max 0001000 0011100 0100010 1101011 0100010 0011100 0001000 finish, n = 7 tot_solutions = 1 min_pushes = 17 max_pushes = 17 min_cnt= 1 max_cnt 1 n = 9 minimum 100000000 110000000 101000000 011100000 000010000 011001000 100101100 100101010 011000111 n = 9 maximum 100110100 111000110 110011101 110101111 110111011 110101111 110011101 111000110 100110100 finish, n = 9 tot_solutions = 256 min_pushes = 25 max_pushes = 51 min_cnt= 4 max_cnt 4 n = 11 minimum 01010000000 11011000000 01010100000 00001110000 01000001000 11101101100 00000101010 11100000111 01010100000 00110110111 00010100010 n = 11 maximum 11010010100 00011110110 11111110101 01100010011 01101001001 11101101100 00101101011 10001100100 11111110101 11110000001 10010110110 finish, n = 11 tot_solutions = 64 min_pushes = 43 max_pushes = 67 min_cnt= 4 max_cnt 4 n = 13 min and max 0111011101110 1010001000101 1100000000011 1000001000001 0000011100000 1000100010001 1101101011011 1000100010001 0000011100000 1000001000001 1100000000011 1010001000101 0111011101110 finish, n = 13 tot_solutions = 1 min_pushes = 65 max_pushes = 65 min_cnt= 1 max_cnt 1 n = 15 min and max 000000010000000 000000111000000 000001000100000 000011010110000 000101010101000 001110000011100 010000010000010 110110111011011 010000010000010 001110000011100 000101010101000 000011010110000 000001000100000 000000111000000 000000010000000 finish, n = 15 tot_solutions = 1 min_pushes = 61 max_pushes = 61 min_cnt= 1 max_cnt 1 n = 17 min and max 11011101101100000 00001000000010000 11000001101011000 00101010001010100 10101010110001110 10000000000000001 01101010110001101 00001010001010000 01110001101010101 10100000100000101 11000000011011000 10000000000000001 00000000011011011 10000000100000001 11000001101011000 10100010101000101 01110111000110101 finish, n = 17 tot_solutions = 4 min_pushes = 103 max_pushes = 103 min_cnt= 4 max_cnt 4 n = 19 minimum 0100000000000000000 1110000000000000000 0001000000000000000 1101100000000000000 0001010000000000000 1110111000000000000 0101000100000000000 0011010110000000000 0001010101000000000 0000000011100000000 0001010001010000000 0011011000111000000 0101010100000100000 1110001110110110000 0000000000000101000 1110001110111011100 0101010100010100010 0011011000001101011 0001010000000101010 n = 19 maximum 1111100100101011000 0111011111101000100 0101101011100110110 1011010110110000101 1101111011101111011 1011100111110110101 0100100000001111110 0100010111100001000 1010010011011100010 1111101011101011111 1101011011010101100 1110101011111111101 1001110010101010101 0000000101010101000 1001111111111111001 1110111010101011111 1101101101010110111 1110111011111011101 1001111100100111110 finish, n = 19 tot_solutions = 65536 min_pushes = 93 max_pushes = 219 min_cnt= 4 max_cnt 4 n = 21 min and max 000000000111000000000 000000001010100000000 000000011101110000000 000000100010001000000 000001101010101100000 000010101000101010000 000111000111000111000 001000000010000000100 011011000000000110110 101000100010001000101 110110110111011011011 101000100010001000101 011011000000000110110 001000000010000000100 000111000111000111000 000010101000101010000 000001101010101100000 000000100010001000000 000000011101110000000 000000001010100000000 000000000111000000000 side 21: 1 out of 2 est time remaining = 0.2 min finish, n = 21 tot_solutions = 1 min_pushes = 125 max_pushes = 125 min_cnt= 1 max_cnt 1 n = 23 minimum 00010001000000000000000 00111011100000000000000 01000000010000000000000 11011011011000000000000 01000000010100000000000 00111011101110000000000 00010001010001000000000 00000000110101100000000 00010000010101010000000 00111000000000111000000 01000100010100000100000 11010110110110110110000 01010100010000000101000 00000000001110111011100 01010100000100010100010 11010110000000001101011 01000101000100000101010 00111011101110000000000 00010100000001000101010 00001101101101101101011 00000100000001000100010 00000011101110000011100 00000001000100000001000 side 23: 1 out of 8 est time remaining = 1.3 min side 23: 4 out of 8 est time remaining = 0.8 min n = 23 maximum 10011111001010001110001 11101110111011010101011 11011011011010011011001 11101110111000110101100 10011111001111011111011 00000000001110111011100 10011111011011001110001 11101110001110001110111 11011010001110011010011 11101101011011101101011 10011011001111011011011 00001101101101101101011 10001011001011011010011 11010101010101101110111 10011110011111011110001 00111000111011100011100 11001011001110001011011 00000000001110111011100 11001011011010011010001 00111000001101011000111 10011111001011011111011 11010110110101010110111 10001111001110001111001 side 23: 5 out of 8 est time remaining = 0.6 min side 23: 7 out of 8 est time remaining = 0.2 min finish, n = 23 tot_solutions = 16384 min_pushes = 151 max_pushes = 311 min_cnt= 4 max_cnt 4 n = 25 min and max 0000011010101010101100000 0000100010101010100010000 0001101100000000011011000 0010100000101010000010100 0111011101101011011101110 1000101000100010001010001 1010110000011100000110101 0010100000001000000010100 1100000000000000000000011 0000100000001000000010000 1101110000011100000111011 0000001000100010001000000 1101101101101011011011011 0000001000100010001000000 1101110000011100000111011 0000100000001000000010000 1100000000000000000000011 0010100000001000000010100 1010110000011100000110101 1000101000100010001010001 0111011101101011011101110 0010100000101010000010100 0001101100000000011011000 0000100010101010100010000 0000011010101010101100000 finish, n = 25 tot_solutions = 1 min_pushes = 209 max_pushes = 209 min_cnt= 1 max_cnt 1 n = 27 min and max 000101010001010100010101000 001101011011010110110101100 010100010001000100010001010 111011100000111000001110111 000101000000010000000101000 110110000000000000000011011 000100000000010000000001000 111000000000111000000000111 010000000001000100000000010 000000000011010110000000000 010000000101010101000000010 111000001110000011100000111 000100010000010000010001000 110110110110111011011011011 000100010000010000010001000 111000001110000011100000111 010000000101010101000000010 000000000011010110000000000 010000000001000100000000010 111000000000111000000000111 000100000000010000000001000 110110000000000000000011011 000101000000010000000101000 111011100000111000001110111 010100010001000100010001010 001101011011010110110101100 000101010001010100010101000 finish, n = 27 tot_solutions = 1 min_pushes = 229 max_pushes = 229 min_cnt= 1 max_cnt 1