task stringclasses 1
value | board stringlengths 36 36 | moves int32 3 52 | cluster_size int64 7 280k | num_walls int32 0 2 | has_walls bool 2
classes | solution listlengths 3 52 | messages dict |
|---|---|---|---|---|---|---|---|
solve | GoooKLGBBBKLAAoJoLHIoJCCHIDDooHxFFoo | 17 | 1,793 | 1 | true | [
"J>2",
"K>2",
"Fv2",
"A>2",
"H<2",
"Cv2",
"D>1",
"G^3",
"A<1",
"H<1",
"I^2",
"J<3",
"Fv1",
"Fv1",
"K<1",
"Dv3",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | EGoIBBEGHIoLFGHAALFCCJKxFooJKoooooKo | 17 | 708 | 1 | true | [
"F^1",
"Hv1",
"Jv1",
"I>1",
"Cv3",
"A<3",
"Cv1",
"Cv1",
"C<3",
"E^1",
"F^1",
"J^3",
"J>1",
"Gv3",
"I<1",
"Ev3",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | xooCCCJDDLxMJAALoMooKFFMGGKoooHHKIIo | 17 | 1,032 | 2 | true | [
"B<1",
"Cv1",
"C<1",
"E^1",
"H>1",
"K>1",
"Ev3",
"A>2",
"G<1",
"Cv1",
"B>1",
"F^3",
"G<2",
"I^1",
"K<1",
"Ev2",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | ooGBBBooGooJAAGHoJxDDHoJFooIooFEEIoo | 17 | 282 | 1 | true | [
"E^1",
"F>2",
"Bv1",
"B<3",
"D^1",
"E^1",
"F>1",
"H^1",
"I>2",
"Ev2",
"A>3",
"E^1",
"I<2",
"Fv1",
"F<1",
"Dv3",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oJBBxoxJooooAAKoooIoKEEEIFFoLoGGHHLo | 17 | 3,163 | 2 | true | [
"D^1",
"F<2",
"H^3",
"G>2",
"H>2",
"Dv2",
"A>2",
"Bv3",
"B<2",
"A<2",
"F^3",
"A>2",
"F^2",
"G<2",
"H<1",
"Ev2",
"A>2"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | IBBoxoIDDDMNAAoLMNJEELooJKFFooxKHHoo | 17 | 13,781 | 2 | true | [
"C>1",
"Ev1",
"D>1",
"E^1",
"K>2",
"L>2",
"Fv2",
"A>2",
"H>1",
"I^4",
"A<1",
"I<1",
"J^2",
"K<3",
"Gv1",
"Gv1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | IooooxICCDDMAAJKoMEEJKLooxGGLoHHHooo | 17 | 6,014 | 2 | true | [
"Ev2",
"D>1",
"F^2",
"H^1",
"J>1",
"K>3",
"Fv2",
"A>1",
"G>1",
"Bv4",
"C<1",
"A<1",
"F<1",
"I^4",
"J<1",
"Fv1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | IBBCCCIDDEEEooJAALFFJoKLooooKMoxHHKM | 17 | 908 | 1 | true | [
"Gv1",
"A<1",
"J^1",
"L>1",
"Jv1",
"I>1",
"Bv4",
"B<1",
"C<1",
"D<1",
"E<1",
"G^2",
"H<1",
"J^1",
"L<1",
"Gv1",
"A>2"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oEBBIKoEFGIKAAFGJoDoFHJoDooHooDCCHoo | 17 | 10,338 | 0 | false | [
"Ev3",
"Gv1",
"Dv1",
"C>2",
"E^1",
"H^1",
"K>3",
"Ev2",
"Fv1",
"A>2",
"Bv3",
"A<1",
"Bv1",
"B<3",
"C^1",
"D^1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBBIoJCCCIoJAAHooKGoHooKGDDDxooooFFF | 17 | 2,471 | 1 | true | [
"Cv2",
"J<1",
"Gv2",
"Cv2",
"B>3",
"C>3",
"D^2",
"A>1",
"G^1",
"H<1",
"Fv1",
"A>2",
"Bv2",
"B<1",
"C<1",
"F^2",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | ooxCCLGooJoLGAAJKoxEEJKooHIooooHIFFF | 17 | 3,388 | 2 | true | [
"Cv1",
"B>1",
"C^1",
"D^1",
"A<1",
"F^1",
"G>2",
"H^1",
"I^3",
"I<1",
"J<3",
"Fv3",
"Fv3",
"G>2",
"Cv3",
"Dv2",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | xoICCoDDIoKLoHAAKLoHEEKLoooJoooFFJGG | 17 | 11,775 | 1 | true | [
"F^1",
"Gv1",
"A<2",
"Bv1",
"B<1",
"F^1",
"H>2",
"I^3",
"I<2",
"J<1",
"K<2",
"Cv3",
"Cv3",
"B>2",
"D^1",
"E^1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | IxooCCIDDDxNJKAAoNJKFFoNooLMooGGLMHH | 17 | 1,882 | 2 | true | [
"C<1",
"E^1",
"Gv1",
"A<1",
"H>2",
"I^1",
"K>1",
"Fv2",
"Bv2",
"D<1",
"J^3",
"I<1",
"L<1",
"Cv3",
"B>1",
"D^1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oBBCCLooIDDLAAIJKoEEEJKoHooJKxHGGGoo | 17 | 389 | 1 | true | [
"B<1",
"Dv2",
"C>1",
"D^1",
"E>1",
"A>1",
"F^2",
"Gv1",
"H>1",
"J^3",
"I<1",
"K<1",
"Dv3",
"D<1",
"F<1",
"G^2",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oBBxLoDDEELMIAAKLMIFFKooooJGGGooJHHH | 17 | 1,940 | 1 | true | [
"B<1",
"F^1",
"Gv2",
"A<1",
"H<1",
"J^2",
"K<2",
"L<2",
"Cv3",
"E>1",
"F^2",
"A>1",
"H>1",
"J^2",
"K<1",
"Hv1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBoooxHooJooHAAJKLDDDJKLxoIFFoooIGGG | 17 | 5,690 | 2 | true | [
"B>1",
"C^1",
"D^1",
"A<1",
"E^1",
"F^1",
"G>3",
"H^3",
"H<3",
"Gv2",
"I<2",
"Fv2",
"J<3",
"Dv3",
"C>2",
"D^1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | xoHICCooHIKooAAoKooxEEKooooJFFGGGJoo | 17 | 420 | 2 | true | [
"Cv1",
"A<1",
"Bv1",
"B<3",
"D^1",
"E^1",
"F>2",
"G^2",
"H<3",
"Fv2",
"Cv1",
"F<2",
"Cv3",
"B>3",
"C^1",
"D^1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | ooIBBoooIJCCAAIJLMoxEELMoFFKooxHHKoo | 17 | 7,858 | 2 | true | [
"Fv2",
"Fv2",
"F>2",
"Dv1",
"G<1",
"Bv2",
"B<3",
"C<4",
"D^2",
"E^2",
"F<2",
"I^4",
"G>2",
"I^1",
"K>2",
"Cv3",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBoxDDooxoooAAooKLHFFFKLHoIJGGooIJoo | 17 | 2,089 | 2 | true | [
"B>1",
"A>1",
"D^1",
"E^1",
"F^3",
"A<1",
"G<1",
"I^3",
"H>3",
"I^2",
"J<4",
"Hv2",
"H<3",
"Ev2",
"Ev2",
"Ev2",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | ooooxooCCoIJoGAAIJoGoooKoGHDDKEEHFFK | 17 | 1,451 | 1 | true | [
"B<1",
"D^1",
"F^1",
"G^1",
"J>1",
"I>2",
"Ev1",
"A<2",
"G^3",
"A>2",
"G^1",
"H<1",
"Ev2",
"I<1",
"J<1",
"Fv1",
"A>2"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | xxDDDLooooKLoAAoKMEEJooMIoJFFMIGGGHH | 17 | 628 | 2 | true | [
"A<1",
"G^2",
"G>1",
"H^1",
"I<1",
"Ev2",
"J<1",
"K<1",
"Ev1",
"Cv1",
"B>1",
"C^1",
"A>3",
"Bv1",
"B<1",
"D^1",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBBJKLooIJKLAAIJooCCooxoHEEoxoHGGGoo | 17 | 5,928 | 2 | true | [
"Cv1",
"Cv1",
"Cv3",
"B>3",
"C^1",
"A>1",
"F>1",
"H^4",
"A<1",
"G<1",
"I<1",
"Cv3",
"C<2",
"E^1",
"J<1",
"Ev2",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oJooBBoJCCxMoAALoMxFFLoMooKGGoHHKIIo | 17 | 18,198 | 2 | true | [
"C<1",
"E^1",
"A<1",
"I>1",
"K>1",
"Fv2",
"F>3",
"G^2",
"H^2",
"I<4",
"Fv2",
"Fv2",
"F<3",
"I^1",
"K<1",
"Dv3",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oxCCCLoDDooLoAAKoMxFFKoMIoJoGGIoJHHH | 17 | 1,424 | 2 | true | [
"D<1",
"A<1",
"E^1",
"G>2",
"I^2",
"J<3",
"Gv1",
"Cv1",
"B>1",
"F^2",
"G<2",
"Ev2",
"A>3",
"Bv1",
"B<1",
"E^1",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBBooJCCDDDJoAAHIKooGHIKooGEEEooooFF | 17 | 2,231 | 0 | false | [
"A<1",
"I^1",
"J<3",
"Gv1",
"Gv1",
"K<1",
"Gv2",
"Cv2",
"B>3",
"D>1",
"E^2",
"A>3",
"Bv2",
"B<1",
"D<1",
"F^2",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | GooooxGHICCCGHIAAKoxEEoKoooJFFoooJoo | 17 | 1,791 | 2 | true | [
"Bv3",
"B^1",
"C^1",
"A<3",
"G>1",
"Cv2",
"C<1",
"E^1",
"G>1",
"H^2",
"I<3",
"Fv2",
"G<1",
"Dv2",
"C>1",
"D^2",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBBCCMHooKLMHAAKLoIoJDDxIoJoooFFFoox | 17 | 707 | 2 | true | [
"Dv1",
"C>1",
"B>1",
"D^1",
"A<1",
"I^2",
"J<2",
"Fv3",
"Fv3",
"H>2",
"Ev2",
"A>1",
"Bv1",
"B<1",
"C<1",
"E^1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | HBBoJoHxDDJKHAAoJKooIoooooIEEEFFGGoo | 17 | 4,054 | 1 | true | [
"F^1",
"J>1",
"I>1",
"Bv3",
"B<1",
"A<1",
"G^1",
"H<2",
"Cv2",
"D>1",
"E^2",
"A>1",
"G^1",
"I<1",
"J<1",
"Gv1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | IxCCLoIDDKLMAAJKoMooJEExooJGGoHHoooo | 17 | 7,707 | 2 | true | [
"Dv1",
"C>1",
"G^1",
"Hv1",
"A>1",
"Bv3",
"D<1",
"A<1",
"H^3",
"I<2",
"J>1",
"Fv3",
"H>2",
"Bv3",
"B<1",
"E^1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | xooCCooDDoLMoAAoLMEEFFLMGGJKHHooJKII | 17 | 6,794 | 1 | true | [
"B<1",
"C<1",
"D^1",
"E^1",
"A<1",
"G>2",
"I^3",
"J^3",
"I<2",
"K<2",
"L<2",
"Cv3",
"Cv3",
"B>2",
"D^1",
"E^1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | GoHBBBGoHIooGAAIoooooxJKDDooJKEEEFFK | 17 | 2,117 | 1 | true | [
"F^1",
"G^1",
"H>3",
"J>1",
"I>1",
"Bv3",
"A<1",
"Bv3",
"B<3",
"C^1",
"A>1",
"D^2",
"F^1",
"I<1",
"J<1",
"Fv1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | GBBoJoGoHIJoAAHIooooxIDDoooooKoxFFoK | 17 | 1,754 | 2 | true | [
"Dv1",
"C>2",
"D^1",
"A>1",
"Bv3",
"A<1",
"Bv1",
"B<3",
"C^1",
"D^1",
"E^1",
"G<1",
"H^4",
"H>1",
"I>2",
"Dv3",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBoIJoooxIJKAAHoJKFGHoooFGDDooooEEEo | 17 | 40,960 | 1 | true | [
"Cv1",
"Cv1",
"B>4",
"C^1",
"Ev2",
"I>1",
"Ev1",
"A>2",
"E^3",
"F^3",
"A<2",
"G^1",
"I<3",
"Gv1",
"J<1",
"Fv2",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oIxCCCoIKoooAAKoMNHJDDMNHJoLooxFFLGG | 17 | 929 | 2 | true | [
"E^1",
"F^1",
"I>2",
"Dv2",
"A>1",
"F^3",
"A<1",
"H^2",
"J^3",
"K>1",
"Iv1",
"I<4",
"Ev2",
"Ev2",
"Ev2",
"Ev2",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | JBBoxoJoLoDDAALooMKEExoMKGGGoMHHIIIo | 17 | 1,016 | 2 | true | [
"E<1",
"F^1",
"I>2",
"K>1",
"J>1",
"Gv1",
"G<1",
"Dv2",
"A>3",
"G^2",
"G>1",
"H^1",
"I<1",
"J<1",
"K<1",
"Fv2",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | GoJoBBGxJoKLHIAAKLHIDDDLHEEEooFFFooo | 17 | 3,289 | 1 | true | [
"D<1",
"F^1",
"I>1",
"J>2",
"Hv1",
"K>1",
"Gv1",
"A<2",
"Cv3",
"C<1",
"E^1",
"A>3",
"H^2",
"I<1",
"J<1",
"Ev3",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | xCCoKoHoIoKxHoIAALooIEELoooJoLoFFJGG | 17 | 1,652 | 2 | true | [
"Dv2",
"I<1",
"Dv2",
"A<3",
"Cv1",
"B>2",
"F^3",
"G<2",
"H^3",
"H>2",
"Bv3",
"B<2",
"C^1",
"D^1",
"J<1",
"Ev1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | GHoBBBGHoJoKAAoJoKxDDEEKooIoooooIFFo | 17 | 560 | 1 | true | [
"D<1",
"F^1",
"H>1",
"J>1",
"Fv3",
"A>2",
"Bv1",
"F>1",
"Bv4",
"B<2",
"A<1",
"E<1",
"I^4",
"G<1",
"J<1",
"Dv3",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | FGBBoJFGHIoJAAHIoKCCoooKooxxoooooooo | 17 | 8,250 | 2 | true | [
"Hv1",
"Ev1",
"D>2",
"E^1",
"F^1",
"A>2",
"H>2",
"Bv3",
"Bv3",
"A<2",
"Bv1",
"Bv1",
"B<4",
"C^1",
"D^1",
"E^1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | ooxCCCDDJEEEAAJooLIFFKoLIGGKoooooxoo | 17 | 708 | 2 | true | [
"Fv1",
"Fv1",
"F<1",
"G^1",
"J>2",
"Dv3",
"C>1",
"A>1",
"F>1",
"H^4",
"A<1",
"G<1",
"I^2",
"J<3",
"Fv1",
"Fv1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBBGHoooxGHoAAFGoIoEFooIoEDDoIoooooo | 17 | 3,264 | 1 | true | [
"Dv1",
"F^1",
"H>2",
"Cv3",
"B>2",
"Ev1",
"A>2",
"E^3",
"A<2",
"F^1",
"G^2",
"H<4",
"Dv2",
"Dv2",
"Dv2",
"Dv1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBooooxJDDoMIJAAoMIEEEoMooKLFFGGKLHH | 17 | 11,615 | 1 | true | [
"B>3",
"C^1",
"D>1",
"E^1",
"Fv1",
"A<2",
"G>2",
"H^4",
"K>1",
"Gv1",
"G<3",
"I^2",
"J<3",
"Gv1",
"L<1",
"Ev3",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | GHIBBMGHICCMGAAJLooooJLoooxKxoFFoKoo | 17 | 15,442 | 2 | true | [
"Fv3",
"E>1",
"F>1",
"G^2",
"A>1",
"Cv3",
"K>1",
"Bv3",
"A<2",
"Bv2",
"Bv2",
"B<4",
"C<4",
"D^2",
"E^2",
"F^2",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oIJoBBoIJoLoHIAALMHCCDDMooKoxoFFKoox | 17 | 1,150 | 2 | true | [
"D<1",
"F^1",
"G^2",
"H<1",
"I>1",
"J^1",
"K>3",
"Iv1",
"H>2",
"Bv3",
"Ev2",
"A<2",
"Bv1",
"B<3",
"D^1",
"E^1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | ooooxMCCooLMIAAKLMIoJKDDEEJFFooGGoHH | 17 | 17,984 | 1 | true | [
"C>1",
"E^2",
"A<1",
"F^1",
"K<1",
"Gv1",
"G<4",
"Ev1",
"Ev1",
"L<1",
"Cv3",
"C>3",
"D^2",
"I^4",
"J<1",
"Fv1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | GoHBBxGoHJDDGAAJoKooIooKxoIFFKooIooo | 17 | 120 | 2 | true | [
"Bv1",
"Ev1",
"E<1",
"G^1",
"I>1",
"Gv1",
"A>2",
"Bv1",
"B<3",
"D^1",
"A<2",
"H^1",
"I<1",
"Fv2",
"E>1",
"F^2",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oxCCCoooIJooAAIJooGHIDDDGHoooKxFFooK | 17 | 1,668 | 2 | true | [
"B>1",
"I>2",
"Cv2",
"A>1",
"D^3",
"A<1",
"Ev1",
"E^3",
"F<3",
"H^3",
"I>1",
"Ev3",
"F>3",
"Cv3",
"C<1",
"D^1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | HoIBBoHoIJCCHAAJKoooooKLoooxxLFFGGGL | 17 | 4,521 | 2 | true | [
"Ev1",
"H^1",
"J>1",
"I>1",
"Bv3",
"A<1",
"Bv3",
"B<2",
"C<3",
"A>1",
"D^2",
"E^2",
"G^1",
"I<1",
"J<1",
"Gv1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | JBBCCoJDDLooJAALooEEKLoxooKGGxIIIooo | 17 | 3,938 | 2 | true | [
"D>1",
"F^1",
"J>3",
"Hv1",
"G>3",
"Bv3",
"B<1",
"E<1",
"A<1",
"H^4",
"A>1",
"G^1",
"H<2",
"I<2",
"J<3",
"Dv3",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | HoBBxoHoJKDDAAJKooIooLoMIEELoMooxGGG | 17 | 410 | 2 | true | [
"C<1",
"E^1",
"H^1",
"I^1",
"J>3",
"Ev2",
"Fv1",
"A>3",
"Bv1",
"B<1",
"H^3",
"A<2",
"I^1",
"J<3",
"Gv1",
"Gv1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | IxCCCMIDDKLMAAJKLNooJEENoooooNFFGGxo | 17 | 163 | 2 | true | [
"Hv1",
"A>1",
"Bv3",
"D<1",
"A<1",
"Gv1",
"Cv1",
"B>1",
"H^3",
"I<2",
"Ev2",
"Ev2",
"A>3",
"Bv1",
"B<1",
"E^1",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | ooooJoooGxJKAAGIJKCCHIDDoFHooooFEEoo | 17 | 1,070 | 1 | true | [
"C^1",
"D^1",
"J>2",
"Ev2",
"A>2",
"Fv1",
"E>2",
"G^3",
"F<2",
"H^1",
"I^1",
"J<4",
"Gv1",
"Gv1",
"G<2",
"Cv3",
"A>2"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBIooooxIDDDAAIooLoooJKLHEEJKoHFFGGo | 17 | 12,663 | 1 | true | [
"Ev1",
"E^1",
"F^1",
"H^1",
"I>2",
"J<1",
"Cv3",
"B>1",
"A>1",
"F^3",
"A<1",
"G^2",
"I<3",
"Dv2",
"Ev1",
"Ev1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oGBBoooGHooJAAHooJoxHDDKEEEoIKoFFoIo | 17 | 2,071 | 1 | true | [
"C>1",
"D^1",
"E^1",
"F<1",
"G^1",
"I^3",
"H>1",
"I>3",
"J<1",
"Cv3",
"C<1",
"E^1",
"A>3",
"G^2",
"I<1",
"Gv1",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | GBBxDDGoHEEEAAHooJooooIJFFFoIJoooooo | 17 | 1,156 | 1 | true | [
"Ev1",
"E<1",
"G^1",
"H^1",
"I>3",
"Gv1",
"A>1",
"Bv3",
"B<1",
"A<1",
"H^1",
"I<2",
"Ev2",
"D>1",
"E^2",
"Fv1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oHxoCCoHJooMAAJoLMGIDDLMGIoKooGEEKFF | 17 | 1,798 | 1 | true | [
"C<1",
"E^1",
"F^1",
"I>2",
"Ev2",
"A>1",
"F^1",
"J^3",
"K<1",
"Iv1",
"I<2",
"Fv2",
"L<1",
"Dv3",
"C>1",
"D^1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oBBoKoxoDDKoAAIJKoooIJEEFFFooLoxHHoL | 17 | 10,354 | 2 | true | [
"B<1",
"D<1",
"F^1",
"G<1",
"I^4",
"I>3",
"J>1",
"Gv2",
"G<3",
"H^2",
"I<3",
"Fv2",
"J<1",
"Cv3",
"D>2",
"E^2",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oxooxoooHJoMAAHJLMoGDDLMFGIKooFGIKEE | 17 | 2,438 | 2 | true | [
"B^1",
"C^1",
"D^1",
"A>2",
"E^1",
"F^1",
"G>2",
"H^1",
"I^1",
"J^1",
"K<4",
"Hv1",
"Hv1",
"H<2",
"Dv3",
"Dv2",
"A>2"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | HxCCCKHDDJoKAAIJoLooIEELooIooLoFFoxo | 17 | 1,675 | 2 | true | [
"Hv1",
"Dv1",
"C>1",
"J<1",
"Gv1",
"A>1",
"Bv3",
"C<1",
"A<1",
"G^3",
"H<2",
"Ev3",
"G>2",
"Bv3",
"B<1",
"D^1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | GBBooKGoCCxKGoAAJKooHIJoooHIEEFFFIoo | 17 | 9,240 | 1 | true | [
"Bv2",
"B<1",
"D<2",
"A<1",
"H^2",
"J>1",
"Fv1",
"A<1",
"H^3",
"A>1",
"H^1",
"I<3",
"Dv3",
"Gv1",
"J<1",
"Ev2",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | GIJBBMGIJKoMHAAKooHooxLxHEEoLoFFoooo | 17 | 15,648 | 2 | true | [
"Fv1",
"E>1",
"F^1",
"A>1",
"I^1",
"J>2",
"Cv3",
"K>1",
"Gv1",
"A<2",
"Cv3",
"Cv1",
"C<3",
"D^1",
"E^1",
"F^2",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | xoCCxLooJKoLAAJKoLIEEFFFIoooooGGHHHo | 17 | 122 | 2 | true | [
"B<1",
"E^1",
"J>1",
"I>1",
"Fv1",
"F<1",
"Ev2",
"A>3",
"F^2",
"F>1",
"H^3",
"G<1",
"H<1",
"I<1",
"J<1",
"Dv3",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBoooLooxoKLAAIoKMxHIEEMoHoJFFoGGJoo | 17 | 25,412 | 2 | true | [
"B>2",
"D^1",
"K<1",
"Ev2",
"A>2",
"F^3",
"A<2",
"G<2",
"I^3",
"H>2",
"I^2",
"J<4",
"Gv1",
"Gv2",
"H>1",
"Fv2",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBBKooJooKCCJoAALMJDDDLMEEFFxMooHHII | 17 | 1,491 | 1 | true | [
"A<1",
"Cv1",
"B>1",
"C^1",
"H<1",
"Dv1",
"D<3",
"E^1",
"F^2",
"H>1",
"Bv1",
"B<1",
"F^1",
"K<1",
"L<1",
"Gv1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | ooJBBLCCJoKLIAAoKLIoDDEEIoooFFGGHHHo | 17 | 1,068 | 0 | false | [
"H<1",
"I<1",
"J<1",
"L>1",
"K>1",
"Gv1",
"A<1",
"Bv1",
"B<3",
"E^1",
"F^1",
"A>1",
"G^1",
"K<1",
"L<1",
"Ev3",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBBoIJooHoIJAAHooKCCDDoKGEEoxKGooooo | 17 | 1,042 | 1 | true | [
"Cv1",
"Fv1",
"Cv1",
"B>3",
"C^1",
"A>1",
"G>1",
"F>1",
"I^4",
"A<1",
"G<1",
"J<1",
"Cv3",
"C<2",
"D^1",
"E^1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | EBBoIJEoGoIJFoGAAKFooHoKFooHCCDDDHoo | 17 | 6,057 | 0 | false | [
"Fv2",
"A<2",
"Dv1",
"C>2",
"I^2",
"K>1",
"Gv1",
"A<1",
"I^3",
"A>1",
"I^1",
"J<3",
"Gv2",
"Hv1",
"K<1",
"Fv2",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | GooJooGBBJoKAAIooKHoICCKHoxoooEEoxoo | 17 | 309 | 2 | true | [
"E^1",
"H>1",
"Cv3",
"D>2",
"E^2",
"A>3",
"Cv2",
"I>1",
"Fv1",
"Bv2",
"C<3",
"E^2",
"A<2",
"F^3",
"G<1",
"Dv3",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oFooIooFBBIJAAGooJCCGoooooHDDDEEHooo | 17 | 3,407 | 0 | false | [
"Cv2",
"C>1",
"D^1",
"E^2",
"A>2",
"H^1",
"J>3",
"Hv1",
"G>2",
"Bv4",
"A<2",
"F<2",
"Bv2",
"C<3",
"D^2",
"E^2",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | JBBooNJCCooNKoLAANKoLMDDxFFMooGGHHxo | 17 | 195 | 2 | true | [
"C>2",
"E>2",
"G^2",
"A<2",
"H^1",
"J>3",
"Hv1",
"A>2",
"Cv3",
"C<2",
"E<2",
"A<2",
"H^3",
"I<1",
"J<1",
"Ev3",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | HoIBBLHoIKoLHAAKoMxoJDDMooJoEEoFFFGG | 17 | 262 | 1 | true | [
"J<1",
"K<1",
"L<1",
"Gv2",
"Ev1",
"D>1",
"E^1",
"A>2",
"G^1",
"H>1",
"I<3",
"Gv1",
"A<2",
"Dv3",
"D<1",
"E^1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | HIBBLoHIoKLxHAAKooooJDDMoxJooMFFFGGM | 17 | 3,629 | 2 | true | [
"Ev1",
"D>1",
"I^1",
"K>1",
"J>1",
"Bv3",
"A<1",
"H^3",
"A>1",
"H^1",
"I<2",
"Ev2",
"Ev2",
"J<1",
"K<1",
"Fv1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oIBBxooIxKEEAAJKoLHoJooLHFFooLHooGGG | 17 | 8,036 | 2 | true | [
"Dv1",
"D<1",
"G^1",
"I>3",
"Fv1",
"Fv1",
"A>2",
"Bv3",
"B<1",
"A<1",
"H^1",
"I<1",
"J<1",
"Dv2",
"C>1",
"D^2",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBHxooGoHDDLGoAAJLEEoIJooooIKoFFFIKo | 17 | 8,511 | 1 | true | [
"F^1",
"A<1",
"H>1",
"I^1",
"K>1",
"Ev3",
"A<1",
"H<1",
"Cv2",
"D<3",
"E^2",
"G^2",
"H>1",
"I^1",
"K<1",
"Gv1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | xCCoJLooHoJLAAHoKLFGDDKoFGoIKoEEEIoo | 17 | 4,158 | 1 | true | [
"Dv3",
"Ev1",
"Cv1",
"B>2",
"C^1",
"A>2",
"F^3",
"A<2",
"G<1",
"J^1",
"K>1",
"Fv1",
"F<1",
"Cv3",
"C<1",
"D^1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBCCKLooooKLAAooKLHIDDDoHIoJEEoxoJGG | 17 | 3,954 | 1 | true | [
"Ev1",
"A>2",
"F^2",
"G^2",
"H<2",
"Dv1",
"C>2",
"B>2",
"E^1",
"A<1",
"I^2",
"J<3",
"Hv1",
"K<2",
"Fv2",
"Fv2",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | ooxoooooICCCAAIJoLHDDJoLHEEEKLFFGGKo | 17 | 667 | 1 | true | [
"I^1",
"K>1",
"J>1",
"Fv1",
"F<1",
"Bv1",
"B<3",
"D^2",
"E^1",
"G^3",
"I>2",
"Fv1",
"A>3",
"G^1",
"I<1",
"Ev2",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBKoooJoKCCoJAAoLoDDooLxFFooxMHHIIIM | 17 | 792 | 2 | true | [
"G>1",
"H>1",
"Dv2",
"A<1",
"Cv1",
"B>3",
"C^1",
"A>1",
"F^3",
"A<1",
"G<1",
"H<1",
"Cv3",
"C<1",
"D<1",
"E^2",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oJBBCCoJooooAAoKooIDDKEEIxGGLMxoooLM | 17 | 898 | 2 | true | [
"A>1",
"E^1",
"F^2",
"G<1",
"H<2",
"J^3",
"K^3",
"J>2",
"K>2",
"Fv2",
"A>1",
"Bv1",
"B<2",
"C<2",
"F^1",
"G^1",
"A>2"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | GoBBooGCCCxoAAIJooEEIJooHooJooHFFFoo | 17 | 883 | 1 | true | [
"C<1",
"I>2",
"Ev2",
"A>1",
"F>1",
"Bv2",
"C<1",
"E^2",
"F>3",
"Cv2",
"C>1",
"D^1",
"G^1",
"H^1",
"I<3",
"Ev1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | HBBCCKHooooKAAIoooooIDDxxGGJoLoooJoL | 17 | 1,222 | 2 | true | [
"Ev1",
"D>1",
"F^1",
"G<3",
"I^4",
"I>2",
"Fv2",
"A>3",
"Bv1",
"B<1",
"H^3",
"A<2",
"I<2",
"Dv3",
"D<1",
"F^1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | ooHBBBxoHIoLGAAIoLGooJDDEEoJKooFFFKo | 17 | 8,504 | 1 | true | [
"I>1",
"Fv1",
"A<1",
"Bv1",
"B<3",
"D^1",
"E^1",
"K<1",
"Gv1",
"G<2",
"J^4",
"H>2",
"J^2",
"J>3",
"Fv2",
"Fv1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBBHooooGHoxAAGoooFoGDDJFEEEIJFoooIo | 17 | 387 | 1 | true | [
"Cv1",
"B>3",
"C^1",
"F<1",
"G^1",
"I^3",
"H>1",
"I>2",
"Bv3",
"B<3",
"C^1",
"D^1",
"A>3",
"G^2",
"I<1",
"Fv1",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | GoHBBKGoHIoKGAAIoooxoIDDEEFFJoooooJo | 17 | 2,415 | 1 | true | [
"Ev1",
"D>1",
"E^1",
"G<2",
"J^3",
"H>2",
"J>2",
"Dv3",
"I>1",
"Bv3",
"A<1",
"Bv1",
"B<4",
"C^1",
"D^1",
"E^1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oJKBBMxJKLoMIAALoNIDDDoNxFFooooGGHHH | 17 | 1,913 | 2 | true | [
"J>2",
"K<1",
"L<1",
"Hv2",
"Ev1",
"D>1",
"E^1",
"A>2",
"H>2",
"Bv3",
"Bv3",
"A<2",
"Bv1",
"B<3",
"C^1",
"D^1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | ooJooLBBJooLoIAAoLoIoKCCHxoKEEHFFFGG | 17 | 5,020 | 1 | true | [
"A>1",
"Bv2",
"C>3",
"D^2",
"E^2",
"A<2",
"H^1",
"J<1",
"Gv1",
"G<3",
"H^2",
"I<1",
"K<1",
"Dv3",
"D>1",
"E^2",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | xooJCCGxoJKLGHAAKLGHIooMEEIooMFFFooo | 17 | 19,562 | 2 | true | [
"Ev2",
"A>1",
"G^3",
"A<1",
"H^1",
"J>3",
"Gv1",
"K>1",
"Ev2",
"A<2",
"Bv3",
"Bv1",
"B<3",
"C^1",
"D^1",
"E^2",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oxJoDDoIJEELxIAAoLoIFFoLoooKGGHHHKoo | 17 | 1,486 | 2 | true | [
"C<1",
"F^1",
"A>1",
"G>2",
"Bv3",
"H^1",
"J>2",
"Dv2",
"D<2",
"A<2",
"G^2",
"H<1",
"I<1",
"Cv3",
"B>1",
"D^1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | IoooBBICCoxNJKLAANJKLEENooxMGGHHHMoo | 17 | 3,263 | 2 | true | [
"C<1",
"E^1",
"Gv1",
"I>1",
"J^1",
"L>1",
"Fv2",
"Bv2",
"B<3",
"D<1",
"F^2",
"A<2",
"H^3",
"I<1",
"K<1",
"Ev3",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBBGIoooFGIoAAFHoooooHooECCHooEDDDoo | 17 | 705 | 0 | false | [
"Dv3",
"G^1",
"I<1",
"Ev1",
"Cv1",
"B>3",
"C^1",
"A>1",
"E^3",
"A<1",
"H<1",
"Cv3",
"A>1",
"Bv1",
"B<3",
"D^1",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oxoCCCoooKDDAAoKoLJoxFFLJGGGHHooooII | 17 | 4,014 | 2 | true | [
"B<1",
"A>1",
"F^1",
"H<1",
"I<1",
"J<1",
"Fv2",
"F>1",
"Cv1",
"C<3",
"E^1",
"F<1",
"I^4",
"G>1",
"I>1",
"Ev2",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | ooxoCCooIDDKAAIoJKoHooJLoHEEJLoFFGGo | 17 | 4,089 | 1 | true | [
"B<1",
"Cv1",
"C<1",
"D^1",
"F^1",
"I>1",
"Fv1",
"A>2",
"F^3",
"A<2",
"G^1",
"I<3",
"Gv1",
"J<1",
"K<1",
"Fv2",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oHJBBBGHJoKxGIAAKooIoooLoIDDDLEEFFoo | 17 | 688 | 1 | true | [
"E^1",
"H^1",
"I>1",
"K>2",
"J>2",
"Gv1",
"A<2",
"Dv3",
"A>2",
"Cv1",
"C<2",
"E^1",
"A>1",
"H^1",
"I<1",
"Gv1",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oBBCCoDDxxMoJAALMoJGGLHHooKIINooKooN | 17 | 1,294 | 2 | true | [
"B<1",
"C<1",
"E^1",
"Fv2",
"A<1",
"G<1",
"J^2",
"K<2",
"Gv2",
"H<1",
"L^4",
"I>1",
"L^2",
"L>3",
"Gv1",
"Gv1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | FoHBBBFoHooJAAHIoJGCCIoKGooooKDDEEEK | 17 | 73 | 0 | false | [
"F^1",
"H>2",
"Cv1",
"C<1",
"F^1",
"I^1",
"K>1",
"Ev2",
"A>1",
"Bv1",
"B<2",
"E^1",
"A>2",
"H^1",
"K<1",
"Gv1",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | GBBIJoGoHIJxAAHoKLDDDoKLEEoooLoFFFoo | 17 | 10,813 | 1 | true | [
"Dv1",
"Gv1",
"Dv1",
"C>2",
"D^1",
"A>1",
"Gv1",
"G>1",
"J>1",
"Bv3",
"A<1",
"Bv1",
"B<3",
"C^1",
"D^1",
"E^1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oBBCCCDDoKoMAAoKLMEEFFLNJGGGoNJHHHxo | 17 | 2,935 | 1 | true | [
"B<1",
"C<1",
"D>1",
"F^1",
"A>1",
"G^1",
"Jv1",
"I>2",
"H>1",
"J^3",
"I<1",
"K<1",
"M<1",
"Gv3",
"I<2",
"Gv2",
"A>3"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | BBCCMNoDDLMNAAJLoooxJLFFooKGGxooKIIo | 17 | 2,180 | 2 | true | [
"Dv1",
"Dv1",
"C>2",
"D<1",
"E^1",
"H^2",
"J^2",
"K<3",
"L<3",
"Iv2",
"I<2",
"Gv3",
"H>2",
"Dv3",
"D<1",
"F^1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | oooJooHoIJBBHoIAAKooCCoKoxEEELFFGGGL | 17 | 2,263 | 1 | true | [
"C^1",
"D^1",
"A<3",
"G<2",
"Cv2",
"Cv2",
"C<3",
"E^2",
"F^2",
"I^2",
"I>1",
"Fv1",
"A>3",
"H^1",
"I<1",
"Gv1",
"A>1"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
solve | FGBBJoFGHoJKAAHooKCCIDDLooIoxLoooooo | 17 | 4,721 | 1 | true | [
"Ev1",
"D>1",
"E^1",
"G^1",
"A>2",
"Iv1",
"Jv1",
"I>1",
"H>2",
"Bv3",
"Bv3",
"A<2",
"Bv1",
"B<3",
"D^1",
"E^1",
"A>4"
] | {
"role": [
"system",
"user",
"assistant"
],
"content": [
"You are an expert Rush Hour (6×6) solver. Given a board, output ONE optimal solution as comma-separated piece slides (e.g., A>2,B<1,Cv3). Each slide (any distance along axis) counts as one move. Goal: the right end of 'A' reaches the right... |
End of preview. Expand in Data Studio
YAML Metadata Warning:empty or missing yaml metadata in repo card
Check out the documentation for more information.
Rush Hour 6×6 — All Entries (0/1/2 Walls)
Derived from Michael Fogleman’s full 6×6 database. See: https://www.michaelfogleman.com/rush/
Columns
- board: 36-char row-major; 'o' empty, 'x' wall (fixed), 'A' primary car, 'B..Z' others (len 2 or 3)
- moves: minimal #moves (a move = slide any distance along piece axis)
- cluster_size: states in the cluster (from source)
- num_walls / has_walls: wall metadata
- task: "moves" or "solve"
- solution: optimal move list (when --task solve and found)
- messages: chat format ready for SFT (Qwen, etc.)
Notes
- This dataset intentionally includes 0-, 1-, and 2-wall puzzles from the official file.
- For sequence supervision, use --task solve (heavy for 6×6; prefer --limit).
- Downloads last month
- 6