od2961/rush6-allwalls-solved-70k · Datasets at Hugging Face

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	oGBBKoEGoIKoEAAILoCCHoLoFoHJooFDDJoo	17	14,669	0	false	[ "E^1", "A<1", "Gv2", "Ev1", "D>2", "E^1", "H^2", "H>3", "Fv2", "A>2", "Cv3", "A<1", "Cv1", "C<3", "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	oHCCJKoHoIJKxAAIoLDDoooLGEEEoLGooFFF	17	5,512	1	true	[ "Dv1", "H>2", "J>1", "K<1", "Gv1", "Dv1", "C>2", "D^1", "A>1", "Bv3", "A<1", "Bv1", "B<3", "C^1", "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	ooIBBKCCIJoKGAAJoLGooxoLHEEoxLHooooo	17	282	2	true	[ "Hv1", "Dv1", "C>1", "E^1", "A>2", "Bv2", "D>1", "F^2", "I^2", "J<1", "Hv1", "A<2", "Cv1", "C<3", "E^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	BBCCoLGooKoLGAAKooHIJKDDHIJooMooxFFM	17	1,347	1	true	[ "Dv1", "C>2", "B>1", "D^1", "E^1", "A<1", "Gv1", "Gv1", "G^2", "H<4", "Fv2", "K^1", "L>1", "Dv3", "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	HBBoKLHoIxKLAAIooLoDDDxooooJFFGGoJoo	17	6,400	2	true	[ "Dv1", "C>2", "E^1", "A>1", "G<1", "H^2", "I<3", "Ev3", "Fv2", "F>1", "Bv3", "A<1", "Bv1", "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	oxCCxooooMEEAAoMoNLFFGGNLHHHIILoJJKK	17	2,472	2	true	[ "A>1", "F^2", "I<1", "J<1", "K<1", "L<1", "Fv2", "G>1", "Dv1", "D<3", "E^1", "G<1", "J^4", "H>1", "J>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	JBBBCCJooLDDJAALooKoxLFFKoGGoMHHIIoM	17	520	1	true	[ "I<1", "Ev1", "E<3", "L>1", "K>1", "Gv1", "Bv1", "B<1", "F^2", "G<1", "J^3", "H>1", "L>1", "Cv3", "C<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	BBJCCCooJKDDAAJKoLIEEFFLIGGoooHHoooo	17	11,103	0	false	[ "Gv2", "I>1", "Ev1", "J>2", "L>3", "Gv1", "G<1", "Cv3", "C<1", "D<3", "E^1", "H<1", "K^4", "I>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	oGIBBBFGIJooFAAJoLoHCCCLoHDDKooooxKo	17	5,533	1	true	[ "E^1", "A<1", "G^1", "Hv1", "H<1", "K^3", "I>2", "K>2", "Dv4", "H<3", "Ev2", "A>2", "Cv1", "C<2", "E^1", "F^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	BBIoooCCIooKoGAAoKoGDDDKoHoJEEoHxJoo	17	1,189	1	true	[ "E^1", "A>1", "G>1", "Cv2", "B>3", "D>3", "E^2", "F^2", "A<2", "G<3", "I^2", "J<1", "Ev3", "D>1", "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	oHoooxoHoCCoAAooKLDDEEKLGoIJKoGoIJFF	17	5,034	1	true	[ "C<1", "A>1", "D^2", "E^1", "G>2", "F>1", "H^3", "G<1", "I^1", "J^1", "K<4", "Hv1", "Hv1", "H<2", "Cv3", "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	FoooxoFooHoJFAAHIJCCCHIJooGDDDEEGooo	17	2,233	1	true	[ "C^1", "D^1", "E^1", "F>3", "G^1", "I>1", "Bv3", "A<1", "F^3", "A>1", "F^3", "G<3", "H<3", "Dv3", "Dv3", "Dv2", "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	FGBBoKFGHJoKAAHJooCCIooxooIxoooooooo	17	3,744	2	true	[ "Ev1", "D>2", "E^1", "F^1", "A>2", "Iv1", "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	ooxoCCHJKooMHJKAAMIoKDDMIooLEEIFFLGG	17	1,204	1	true	[ "B<1", "C^1", "D^1", "F^1", "G^1", "H>1", "K<1", "Fv2", "A<2", "I^3", "I<1", "J<1", "L<1", "Ev3", "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	xooJCCooIJoLooIAALDDEEKMFFFoKMooxHHH	17	637	2	true	[ "D^1", "A<3", "Bv1", "Bv1", "B<3", "D^1", "E^1", "H^3", "H>1", "I^1", "J>3", "Fv2", "A>3", "H^1", "J<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	GoJBBoGxJooLHIAAKLHIDDKMHIEEEMFFoooo	17	3,831	1	true	[ "E^1", "H^1", "I>1", "J^1", "K>1", "L>2", "Gv1", "Gv1", "A<2", "Cv3", "C<1", "E^1", "A>3", "I^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	GoBBxoGxEEoKAAIooKHoIJoLHFFJoLHooooo	17	1,438	2	true	[ "C<1", "Iv1", "Ev1", "D>2", "H^3", "I>2", "Fv1", "A>3", "Bv1", "B<1", "H^3", "A<2", "I<2", "Dv3", "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	ooFooJooFGHJAAFGHJooooIooEBBIooECCDD	17	5,293	0	false	[ "D^1", "E^1", "F^1", "G^1", "H>1", "I<2", "Bv3", "A>2", "F^3", "A<2", "G^2", "H<3", "Fv2", "Fv1", "J<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	IBBLooIoKLCCJoKAAMJDDooMJEEooxGGxooo	17	594	2	true	[ "I>2", "J>2", "Ev2", "A<2", "Dv1", "C>3", "D^1", "A>2", "H^3", "A<2", "I<2", "J<2", "Dv3", "D<1", "E<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	BBCCCoIJoDDoIJAALoEEKoLoooKFFFoGGxoo	17	5,642	1	true	[ "C>1", "F<1", "G^1", "K<1", "Iv1", "H>3", "Dv2", "Dv2", "D<2", "A<2", "I^4", "A>2", "H^1", "I<1", "J<2", "Fv2", "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	GoJoBBGIJooLGIJAALHCCDDLHooKEEFFoKoo	17	1,978	0	false	[ "D<1", "E^1", "F^1", "I>1", "J^1", "L>3", "Gv1", "G<1", "Dv3", "A<2", "H^2", "I<1", "K<1", "Ev3", "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	ooLoBBHJLoCCHJAAMNIKDDMNIKooxOFFGGoO	17	1,470	1	true	[ "C<1", "D^1", "E^1", "F<1", "A<2", "H^2", "L^1", "N>2", "M>2", "Iv1", "Iv1", "I<2", "Dv3", "D<1", "F<1", "G^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	FoxoooFoHCCCAAHIoJGooIoJGDDDoKEEoooK	17	802	1	true	[ "Cv1", "C<1", "F^2", "I^2", "I>2", "Ev1", "A>1", "J>1", "Gv1", "Bv2", "C<2", "E^2", "A>2", "G^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	BBBoHJooGoHJAAGoIKFCCoIKFooDDoxooooo	17	6,761	1	true	[ "Gv1", "Dv1", "J<1", "Fv1", "Cv1", "B>3", "C^1", "A>1", "F^3", "A<1", "G<1", "J<2", "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	JBBLoxJDDLoMAAKooMEEKooMooxoGGooHHII	17	9,502	2	true	[ "Dv2", "C>2", "I<1", "J<1", "K<1", "Ev2", "D>3", "E^2", "A>1", "G>1", "Bv3", "A<1", "Bv1", "B<3", "C^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	xooxoKHDDDoKHAAJooEEoJooooIFFFGGIooo	17	4,321	2	true	[ "Bv2", "C>2", "G^1", "I>3", "Gv1", "F>1", "Bv3", "A<1", "E<1", "G^4", "A>1", "F>1", "G^2", "H<3", "Ev1", "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	oHBBBLoHJoKLAAJoKMGICCxMGIEEoMxooooo	17	1,053	2	true	[ "Gv1", "Dv1", "C>1", "D^1", "A>1", "G^3", "A<1", "Hv1", "H<2", "K>1", "Dv3", "A>2", "Cv1", "C<2", "E^1", "F^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	oHoooLoHBBKLAAIoKLGoIJCCGDDJooGEEFFF	17	4,692	0	false	[ "E^1", "H^1", "J>3", "Fv1", "Fv1", "A>2", "Bv3", "D<1", "A<1", "E^1", "H^3", "I<1", "J<1", "K<1", "L<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	oooxooCCooLMAAooLMIDDEEMIoJKFFxoJKHH	17	3,726	2	true	[ "B>1", "C^1", "D^1", "A>1", "E^3", "A<1", "F<1", "G>1", "H^2", "I^2", "J<4", "Fv1", "K<3", "Fv2", "H<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	BBBoIooFCCIooFAAIooGHoDDoGHooJEEEooJ	17	2,092	0	false	[ "H<1", "I^1", "J>3", "Fv1", "Fv1", "F<3", "Cv2", "B>3", "C^1", "D>1", "A<2", "I^4", "G>2", "I^1", "J<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	GooJBBGooJKLHAAoKLHCCCKoooIDDxFFIooo	17	12,258	1	true	[ "Cv1", "C<2", "E^1", "F^1", "Gv1", "A<1", "H>2", "I^3", "J<2", "K>1", "Hv1", "H<3", "Dv3", "C>1", "E^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	FoooIoFBBoIJAAGooJCCGoooooHoxoEEHooo	17	5,484	1	true	[ "Cv2", "C>2", "D^1", "E^2", "A>1", "H^1", "I>3", "Hv1", "G>1", "Bv4", "A<1", "F<1", "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	BBBCCLHooJKLHAAJKoHDDoKoooIooxFFIGGo	17	702	1	true	[ "Dv1", "C>1", "B>1", "D^1", "Ev2", "G<1", "I^1", "K<1", "Ev2", "A>2", "G^2", "G>1", "Bv1", "B<1", "C<1", "F^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	xoJKCCDDJKLMHIAALMHIEEEMHooooooxoGGG	17	768	2	true	[ "Hv1", "Hv1", "A<2", "Bv1", "Bv1", "B<3", "E^1", "F^1", "G^1", "J>1", "Gv2", "A>3", "I^2", "J<1", "K<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	ooxKCCDDoKoLAAoooLEEEFFLJooGGGJHHHII	17	982	1	true	[ "Bv1", "B<1", "C>1", "E^1", "A>1", "G>1", "F>1", "H^3", "G<1", "H<1", "I<1", "J<1", "K<1", "Cv3", "B>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	oHBBCCoHIooKAAIoJKoDDoJoxFFoJoGGoooo	17	10,939	1	true	[ "Fv2", "F^1", "G<1", "I>2", "J>3", "Ev3", "A>2", "F>2", "Bv4", "B<2", "A<2", "E<2", "H^4", "I<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	oooHBBoGoHJooGAAJooGCCDDoooIxKFFoIoK	17	289	1	true	[ "D^1", "F<1", "G<1", "I^3", "H>1", "I^1", "J>4", "Hv1", "G>1", "Bv3", "A<1", "Bv1", "B<3", "C^1", "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	oBBBxoDDIJoKAAIJoKHEEJoxHoooooHGGGoo	17	536	2	true	[ "B<1", "E^1", "F^1", "H>2", "I>2", "Fv3", "E>1", "A>1", "G<2", "Cv1", "B>1", "F^3", "G<1", "H^1", "I<3", "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	BBBoCCoxEEMooAALMooFFLGGooKHHNxoKJJN	17	1,398	2	true	[ "C<1", "A<1", "G<1", "I^2", "J<3", "L<2", "Gv2", "H<1", "K^4", "I>1", "K^1", "L>3", "Gv2", "Hv1", "H<2", "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	BBBCCNDDEEENJAAoMNJFFoMoKLGGHHKLooII	17	334	0	false	[ "A>1", "I>1", "K^2", "L<1", "M<1", "N<1", "Dv3", "C>1", "B>1", "E>1", "D>1", "F^2", "K^2", "L<1", "M<1", "Iv1", "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	oooGoxooFGooAAFHooCCFHoIoEDDoIoEoooo	17	1,754	1	true	[ "C^1", "F^1", "H>2", "Dv2", "E>3", "Bv3", "A>2", "F^4", "A<2", "E^3", "F<3", "G^2", "H<4", "Cv3", "Dv1", "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	oJoBBBxJoKoMAAoKLMDDEELMIFFFooIGGGxo	17	446	2	true	[ "C<1", "E^1", "A>1", "F^1", "H>2", "G>1", "I^2", "J<1", "K<1", "Ev3", "A>1", "Bv1", "B<1", "E^1", "H<1", "Dv3", "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	oBBCCoooLDDxAALMooKFFMoNKGGHHNxJJJoo	17	10,982	2	true	[ "B<1", "C>1", "D^1", "I^1", "K>1", "Fv1", "A>3", "G^2", "H<1", "J<1", "Cv3", "E<2", "A<2", "I^3", "K<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	HIBBMNHIJKMNAAJKoooooLCCooxLooEEFFox	17	2,000	2	true	[ "Ev1", "Ev1", "D>2", "E^1", "F^1", "A>2", "Bv3", "Bv3", "A<2", "Bv1", "Bv1", "B<4", "C^1", "D^1", "E^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	BBBooLIoxDDLIAAKoLIooKEEJxGGooJHHHoo	17	1,633	2	true	[ "B>1", "D^1", "H^1", "I>2", "J<1", "Fv2", "G<3", "H^2", "I<1", "Dv3", "D>1", "J>1", "Fv1", "Bv1", "B<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	xoHCCLooHIKLGAAIKMGDDoKMxooJoooooJFF	17	6,104	2	true	[ "G^1", "Hv1", "Dv1", "C>1", "E^1", "H<1", "J^1", "K<2", "Fv2", "A>2", "Bv3", "A<2", "Bv1", "B<3", "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	BBCCJoooxIJoAAHIooGoHEEEGFFooKGooooK	17	2,136	1	true	[ "Dv1", "C>1", "B>1", "I>2", "Fv2", "A>1", "F^3", "G<3", "J^4", "J>1", "Fv3", "G>1", "Bv1", "B<1", "C<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	ooIBBBooIJCCoAAJooxooJEEFFGGoKoHHHoK	17	5,588	1	true	[ "A<1", "Bv1", "B<3", "D^1", "F<3", "I^2", "I>2", "J<1", "Cv3", "B>3", "C^1", "D<1", "A>3", "Bv1", "B<1", "E^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	oxKCCCooKLDDAAKLoMoxFFoMoGGoHHoIIoJJ	17	3,333	2	true	[ "H<1", "I<1", "J<1", "K<1", "Fv2", "F>2", "Bv3", "B<1", "Cv1", "C<3", "D^1", "F<1", "I^4", "G>1", "I>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	BBBooLooxDDLAAIooLHoIJKoHEEJKooFFGGG	17	4,525	1	true	[ "B>1", "G^1", "H^1", "I>2", "Ev1", "A>1", "G^3", "A<1", "H^1", "I<3", "Fv1", "Fv1", "Fv1", "J<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	BBCCCoxEELoMJAALoMJoKFFMJoKoGGoxIIoo	17	3,339	2	true	[ "C>1", "Gv1", "A<1", "J<1", "Fv2", "K>1", "Gv1", "G<2", "Ev1", "D>3", "E^1", "G>2", "I^4", "H<2", "J<2", "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	GIoKBBGIJKoMHIJAAMHooCCoHDDoLxFFFoLo	17	11,366	1	true	[ "F^1", "A<1", "I<1", "K^3", "J>1", "K>2", "L>2", "Cv3", "Hv1", "A<2", "Cv3", "Cv1", "C<3", "D^1", "E^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	ooBBBKoCCoJKAAooJLHDDoJLHxIFFLGGIooo	17	8,801	1	true	[ "B<1", "D<1", "E^1", "Fv1", "Dv1", "G>2", "I^3", "H<1", "J<1", "Cv3", "B>2", "D^1", "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	FBBBJLFoIoJLAAIoKLGHCCKoGHooKoDDoxoo	17	794	1	true	[ "Ev3", "Fv1", "Dv1", "C>2", "D^1", "A>2", "G^3", "A<2", "K>1", "Gv1", "G<2", "Dv3", "A>2", "Cv1", "C<2", "E^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	FGBBJKFGHoJKooHAAKoxxIoooooIoooooIEE	17	7,931	2	true	[ "Bv1", "Bv1", "B<2", "G^1", "A<1", "Dv3", "A>1", "Cv1", "B>3", "E^1", "F^1", "A<2", "G^1", "I<3", "Ev3", "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	ooGooJooGCCJxoAAIKDDoHIKoFoHIooFoEEE	17	1,899	1	true	[ "A<1", "J<1", "Fv2", "Cv2", "C>1", "G^3", "A>1", "G>2", "H^4", "A<1", "H<1", "Dv3", "D<1", "F^2", "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	HoIBBxHoIoooHAAKooooJKDDEEJFFLGGGooL	17	1,693	1	true	[ "Bv1", "E^1", "G<1", "J^3", "H>1", "J>1", "Ev2", "A>2", "Bv1", "B<3", "D^1", "A<2", "G^3", "H<1", "J<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	oJoLBBoJKLooAAKLMNCCDDMNIEEoxoIGGGox	17	3,807	2	true	[ "E^1", "A>1", "F^1", "G^1", "I>2", "H>1", "J^4", "A<1", "I<1", "K<1", "Dv3", "L<1", "Dv3", "D<2", "E^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	BBCCooDDDKEEAAoKLoIoFFLoIoJxLoIoJHHo	17	436	1	true	[ "C>2", "B>1", "A>1", "I<1", "Ev1", "D>1", "H^3", "I<1", "J^1", "K<3", "Hv1", "Iv1", "H>1", "Bv2", "D<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	ooIBBLxoIDDLoAAJoooooJEEoHxKoooHoKGG	17	9,206	2	true	[ "A<1", "Bv2", "B<3", "D<2", "F^1", "H^1", "I^1", "J<3", "Hv1", "H<1", "Cv4", "G>1", "Dv1", "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	JooxCCJDDDLoAAooLoEEoKFFGGGKooHHoxoo	17	645	2	true	[ "A>1", "F>1", "Bv2", "C<1", "G^2", "I>1", "J>1", "Fv2", "F<1", "G<2", "Ev3", "F>2", "E>1", "G^2", "H<1", "Dv2", "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	IBBBooIooKoLAAoKoLCCDDoLoJEEFFoJGGHH	17	2,610	0	false	[ "E^1", "A>1", "Bv1", "B<1", "E^1", "A>1", "G>2", "F>2", "H^3", "G<1", "H<1", "I<1", "J<1", "K<1", "L<1", "Dv3", "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	xoooooHooxKoHAAJKoDDIJKoooIEEooFFGGo	17	2,663	2	true	[ "C^1", "G>1", "H<1", "Fv1", "I>1", "Dv2", "D>3", "Cv2", "A<1", "E^4", "E<2", "F^2", "G<3", "Dv1", "I<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	ooIxoxooIJooAAIJoooHoooKGHDDoKGEEFFF	17	3,447	2	true	[ "E^1", "F^1", "G>2", "Cv2", "H<1", "Bv3", "A>2", "C^3", "D^3", "A<2", "E^2", "F^1", "G<4", "Dv2", "Dv1", "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	BBIoooooIxDDAAJooLoHJoKLoHEEKLooFFGG	17	1,887	1	true	[ "H^1", "I>1", "Ev1", "Cv1", "B>3", "C^1", "A>2", "G^3", "A<2", "H^1", "I<3", "Fv1", "Fv1", "J<1", "K<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	BBCCCKoooooKoAAoJLoxEEJLFFIGGLooIHHH	17	459	1	true	[ "A<1", "E^1", "G>1", "I^1", "K<1", "Fv1", "Dv1", "C>1", "F^3", "G<1", "J<1", "Ev2", "A>3", "Cv1", "C<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	BBBoJKCCooJKGHAAJoGHIooxEEIFFooooooo	17	999	1	true	[ "Cv1", "Cv1", "B>3", "C>2", "F^2", "G^2", "A<2", "H^1", "J<1", "Fv2", "E>1", "G^2", "A>3", "Dv1", "D<1", "G^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	BBoIoooHoICCoHAAoJDDDooJEEoooKFFFoxK	17	5,120	1	true	[ "G>2", "H>2", "Dv2", "A<1", "Cv1", "B>4", "C^1", "A>1", "F^3", "A<1", "G<2", "H<1", "Cv3", "C<1", "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	oxHICCxoHIoJGoHAAJGEEEoKoooooKFFoooo	17	1,150	2	true	[ "Fv1", "Hv1", "G>2", "Bv3", "A<3", "F^3", "I>1", "Fv1", "F<3", "Cv4", "C<1", "D^1", "E>3", "F^1", "I<1", "Bv3", "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	BBBCCKHDDJoKHAAJooEEIooxooIGGLooIooL	17	260	1	true	[ "Dv1", "C>1", "B>1", "D^1", "Fv1", "E>2", "A<1", "I^2", "J<3", "Ev2", "A>1", "Bv1", "B<1", "C<1", "F^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	oxCCCLDDEEKLAAJoKMooJFFMxHHooMoIIooo	17	2,310	2	true	[ "Hv1", "Cv1", "B>1", "J>2", "K<1", "Gv2", "G<3", "Ev1", "D>1", "I^4", "J<1", "Gv1", "A>3", "Bv1", "B<1", "F^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	ooBBJLoxDDJLAAoIKoEEEIKoHooIoxHoGGGo	17	1,438	2	true	[ "B<1", "Dv2", "A>1", "J<1", "Fv2", "Cv2", "C>2", "D^2", "G>1", "H^3", "H<1", "J<1", "Cv3", "D<2", "E^2", "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	GIBBoLGIoKoLHAAKoMHCCCoMDDJoooxoJoFF	17	15,427	1	true	[ "L<1", "Hv2", "Ev1", "D>2", "E^1", "A>2", "H>2", "J^2", "J>3", "Cv3", "Gv1", "A<2", "Cv1", "C<3", "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	IBBBKLICCoKLAAJoKoooJDDxoxGGooHHHooo	17	7,239	2	true	[ "Ev1", "I>1", "J>3", "Gv2", "G<3", "H^2", "I<1", "J<2", "Dv3", "C>2", "D>2", "F^2", "A>3", "Cv1", "C<1", "F^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	BBGoooooGxoxAAHIoooFHIoJoFEEoJoooooo	17	2,163	2	true	[ "G^1", "H>2", "Dv1", "Cv1", "B>3", "C^1", "Dv1", "A>2", "E^3", "A<2", "F^1", "G^1", "H<4", "Ev1", "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	oGBBBLoGHIJLAAHIJMFCCIKMFoooKoxoEEoo	17	9,856	1	true	[ "Hv1", "Dv1", "C>1", "D^1", "A>1", "H^3", "A<1", "I<1", "Dv3", "L<1", "Ev2", "A>2", "Cv1", "C<2", "E^1", "F^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	HoxoxoHoDDKLAAIJKLooIJEEoooooMFFFGGM	17	3,891	2	true	[ "C<1", "E^1", "Fv1", "A>1", "F^2", "H<1", "I^1", "K>1", "J>1", "Bv4", "D<1", "A<1", "F^2", "G<3", "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	BBooJKCCDDJKoHAAJooHoIoooxoIoxoooIGG	17	662	2	true	[ "B>2", "Cv2", "Cv2", "D>2", "C>2", "E^2", "A<1", "H^1", "I<3", "Fv1", "A>1", "Bv2", "C<1", "D<1", "Fv1", "F^2", "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	GBBoKLGoHoKLAAHooLoCCCxoooIJooEEIJFF	17	1,234	1	true	[ "Dv1", "C>2", "E^1", "A>1", "Bv3", "A<1", "Bv1", "B<3", "D^1", "E^1", "A>1", "F^2", "G<1", "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	GBBBxoGoooJoGoAAJooxHIEEooHIooFFFIoo	17	396	2	true	[ "Bv1", "B<1", "A<1", "F^3", "H>1", "Dv2", "A<1", "F^2", "G<2", "Ev3", "F>2", "Dv2", "A>1", "D^1", "H<1", "Cv3", "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	ooxooNIKLCCNIKLAANJDDMooJxoMFFJGGHHo	17	2,038	2	true	[ "C^1", "D^1", "G^1", "K<1", "L>1", "Iv1", "H>2", "Ev3", "A<2", "G<2", "I^2", "J<1", "L<1", "Dv3", "D>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	FoxooxFooIKoAAoIKLGDDJKLGoHJooGoHEEo	17	1,501	2	true	[ "C^1", "D^1", "A>1", "E^1", "F^1", "J>1", "Hv1", "G>3", "H^1", "I^1", "J<4", "Gv1", "Gv1", "G<2", "Dv3", "Dv2", "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	oBBIJKCCCIJKGAAoJoGoooooGoHDDxFFHooo	17	12,230	1	true	[ "B<1", "Ev2", "H^1", "J>1", "Fv1", "A<1", "H^1", "I<2", "Cv3", "Cv3", "C>3", "D^2", "A>3", "Cv2", "C<1", "E^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	xCCJooooIJDDAAIoKMGHEEKMGHooLMFFFoLo	17	4,176	1	true	[ "Cv1", "B>3", "C^1", "D^1", "A>2", "Gv1", "H^3", "A<2", "L>1", "Hv1", "H<2", "Cv3", "Cv3", "C<2", "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	xooCCCGooIDDGAAIoJEEEooJooHooJooHFFF	17	1,235	1	true	[ "B<1", "Dv1", "D<3", "E^1", "F^2", "G>3", "Dv3", "D<1", "A<1", "H^3", "G<3", "Fv2", "I<1", "Cv3", "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	IBBCCoIDDDMoAAKoMoJoKLEEJFFLoNooxHHN	17	1,473	1	true	[ "Hv1", "H^1", "K>2", "Gv1", "A>1", "Bv2", "B<1", "C<1", "D<1", "E^1", "G^1", "I<1", "L^4", "J>1", "L>1", "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	ooxCCoDDIJKoAAIJKoooIooooHEEoooHFFGG	17	5,245	1	true	[ "B>1", "Ev1", "Ev1", "G^1", "H>1", "I<2", "Dv2", "C>4", "D^2", "A>2", "F^3", "A<2", "G^2", "H<3", "Ev2", "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	oooJooxCCJooooIAAKDDIooKoHEEEKoHFFGG	17	5,089	1	true	[ "E^1", "H>1", "Ev1", "A<3", "Bv2", "B>2", "F^3", "H<1", "Dv1", "C>1", "D^2", "F>2", "G^1", "I<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	GBBoooGoCCxKGoAAJKooHIJoooHIEEFFFIoo	17	14,831	1	true	[ "Bv2", "B<1", "C<2", "D^1", "A<1", "H^2", "J>1", "Fv1", "A<1", "H^3", "A>1", "H^1", "I<3", "Hv1", "J<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	ooooJooooxJKAAoIJKGCCIDDGHEEooGHFFoo	17	2,574	1	true	[ "C^1", "I>2", "J>2", "Dv2", "A>2", "D^3", "E>1", "G^4", "A<1", "F<2", "H^2", "I<3", "J<3", "Fv2", "G<2", "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	KoxoCCKDDDMoAAoLMoEEoLFFGGxooNIIIJJN	17	757	2	true	[ "C<1", "A>1", "G>1", "Bv2", "C<1", "F^1", "H<1", "J^4", "I>1", "L>1", "Ev3", "D>1", "F^1", "G<1", "H<2", "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	oDBBGIoDoEGIAAoEHJCCCFHJoooFoooooooo	17	3,860	0	false	[ "Gv2", "Dv1", "Gv1", "Dv1", "C>2", "D^1", "A>2", "Hv1", "G>2", "Bv3", "A<1", "Bv1", "B<3", "C^1", "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	BBICCLDDIoKLGHAAKLGHoJooGEEJoooooJFF	17	21,497	0	false	[ "Ev1", "D>1", "Fv2", "A>1", "Cv2", "B>2", "D>2", "F^1", "G^2", "K<1", "Hv1", "A<2", "I^1", "L<3", "Gv2", "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	oooLBBxKoLMoIKAAMoIKDDEEJFFooNJGGHHN	17	831	1	true	[ "D^1", "G<1", "H<1", "J>1", "K^3", "I>1", "H>1", "M>1", "L>1", "Bv3", "A<1", "Bv1", "B<3", "C^1", "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	ooxCCoIDDDooIAAKooEEJKooooJFFFooxHHo	17	2,064	2	true	[ "B>1", "C^1", "D>2", "A<1", "G^2", "H<3", "I>1", "Fv2", "F>4", "H^2", "H>3", "Dv2", "A>1", "Bv2", "C<3", "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	xoGoooFoGCCKFoAAIKDDoHIooooHJoEEEHJo	17	8,297	1	true	[ "E^1", "A<1", "G>1", "H^1", "J>1", "Dv3", "A<1", "G<1", "Bv2", "C<3", "D^2", "F^2", "G>1", "H^1", "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	oGBBJooGHIJoAAHIKooooxKoooxoKooEEFFo	17	248	2	true	[ "H<1", "I<1", "Gv1", "Dv1", "C>2", "D^1", "E^1", "A>2", "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	oooxCCoooHooAAoHoIoGDDoIoGEEoIFFoooo	17	2,420	1	true	[ "D^1", "G>2", "H>4", "Ev1", "E<1", "Cv3", "A>2", "D>1", "E^4", "A<1", "E<1", "F^2", "G<3", "Ev1", "H<1", "Dv2", "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	ooEFooooEFGHAAEFGHCDoooICDBBoIoooooo	17	9,305	0	false	[ "D^1", "E^1", "H^1", "I>2", "Bv3", "Bv3", "A>2", "E^3", "F^3", "A<2", "G^2", "H^2", "I<4", "Fv2", "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	oHBBoxoHIoooAAIooKxoIJoKGEEJoKGFFFoo	17	2,182	2	true	[ "E^1", "F^1", "H>3", "Fv1", "I>2", "Dv2", "A>2", "Bv3", "B<1", "A<1", "F^3", "A>2", "F^1", "H<1", "I<1", "Dv2", "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

oGBBKoEGoIKoEAAILoCCHoLoFoHJooFDDJoo

17

14,669

0

false

[ "E^1", "A<1", "Gv2", "Ev1", "D>2", "E^1", "H^2", "H>3", "Fv2", "A>2", "Cv3", "A<1", "Cv1", "C<3", "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

oHCCJKoHoIJKxAAIoLDDoooLGEEEoLGooFFF

17

5,512

1

true

[ "Dv1", "H>2", "J>1", "K<1", "Gv1", "Dv1", "C>2", "D^1", "A>1", "Bv3", "A<1", "Bv1", "B<3", "C^1", "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

ooIBBKCCIJoKGAAJoLGooxoLHEEoxLHooooo

17

282

2

true

[ "Hv1", "Dv1", "C>1", "E^1", "A>2", "Bv2", "D>1", "F^2", "I^2", "J<1", "Hv1", "A<2", "Cv1", "C<3", "E^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

BBCCoLGooKoLGAAKooHIJKDDHIJooMooxFFM

17

1,347

1

true

[ "Dv1", "C>2", "B>1", "D^1", "E^1", "A<1", "Gv1", "Gv1", "G^2", "H<4", "Fv2", "K^1", "L>1", "Dv3", "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

HBBoKLHoIxKLAAIooLoDDDxooooJFFGGoJoo

17

6,400

2

true

[ "Dv1", "C>2", "E^1", "A>1", "G<1", "H^2", "I<3", "Ev3", "Fv2", "F>1", "Bv3", "A<1", "Bv1", "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

oxCCxooooMEEAAoMoNLFFGGNLHHHIILoJJKK

17

2,472

2

true

[ "A>1", "F^2", "I<1", "J<1", "K<1", "L<1", "Fv2", "G>1", "Dv1", "D<3", "E^1", "G<1", "J^4", "H>1", "J>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

JBBBCCJooLDDJAALooKoxLFFKoGGoMHHIIoM

17

520

1

true

[ "I<1", "Ev1", "E<3", "L>1", "K>1", "Gv1", "Bv1", "B<1", "F^2", "G<1", "J^3", "H>1", "L>1", "Cv3", "C<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

BBJCCCooJKDDAAJKoLIEEFFLIGGoooHHoooo

17

11,103

0

false

[ "Gv2", "I>1", "Ev1", "J>2", "L>3", "Gv1", "G<1", "Cv3", "C<1", "D<3", "E^1", "H<1", "K^4", "I>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

oGIBBBFGIJooFAAJoLoHCCCLoHDDKooooxKo

17

5,533

1

true

[ "E^1", "A<1", "G^1", "Hv1", "H<1", "K^3", "I>2", "K>2", "Dv4", "H<3", "Ev2", "A>2", "Cv1", "C<2", "E^1", "F^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

BBIoooCCIooKoGAAoKoGDDDKoHoJEEoHxJoo

17

1,189

1

true

[ "E^1", "A>1", "G>1", "Cv2", "B>3", "D>3", "E^2", "F^2", "A<2", "G<3", "I^2", "J<1", "Ev3", "D>1", "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

oHoooxoHoCCoAAooKLDDEEKLGoIJKoGoIJFF

17

5,034

1

true

[ "C<1", "A>1", "D^2", "E^1", "G>2", "F>1", "H^3", "G<1", "I^1", "J^1", "K<4", "Hv1", "Hv1", "H<2", "Cv3", "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

FoooxoFooHoJFAAHIJCCCHIJooGDDDEEGooo

17

2,233

1

true

[ "C^1", "D^1", "E^1", "F>3", "G^1", "I>1", "Bv3", "A<1", "F^3", "A>1", "F^3", "G<3", "H<3", "Dv3", "Dv3", "Dv2", "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

FGBBoKFGHJoKAAHJooCCIooxooIxoooooooo

17

3,744

2

true

[ "Ev1", "D>2", "E^1", "F^1", "A>2", "Iv1", "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

ooxoCCHJKooMHJKAAMIoKDDMIooLEEIFFLGG

17

1,204

1

true

[ "B<1", "C^1", "D^1", "F^1", "G^1", "H>1", "K<1", "Fv2", "A<2", "I^3", "I<1", "J<1", "L<1", "Ev3", "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

xooJCCooIJoLooIAALDDEEKMFFFoKMooxHHH

17

637

2

true

[ "D^1", "A<3", "Bv1", "Bv1", "B<3", "D^1", "E^1", "H^3", "H>1", "I^1", "J>3", "Fv2", "A>3", "H^1", "J<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

GoJBBoGxJooLHIAAKLHIDDKMHIEEEMFFoooo

17

3,831

1

true

[ "E^1", "H^1", "I>1", "J^1", "K>1", "L>2", "Gv1", "Gv1", "A<2", "Cv3", "C<1", "E^1", "A>3", "I^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

GoBBxoGxEEoKAAIooKHoIJoLHFFJoLHooooo

17

1,438

2

true

[ "C<1", "Iv1", "Ev1", "D>2", "H^3", "I>2", "Fv1", "A>3", "Bv1", "B<1", "H^3", "A<2", "I<2", "Dv3", "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

ooFooJooFGHJAAFGHJooooIooEBBIooECCDD

17

5,293

0

false

[ "D^1", "E^1", "F^1", "G^1", "H>1", "I<2", "Bv3", "A>2", "F^3", "A<2", "G^2", "H<3", "Fv2", "Fv1", "J<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

IBBLooIoKLCCJoKAAMJDDooMJEEooxGGxooo

17

594

2

true

[ "I>2", "J>2", "Ev2", "A<2", "Dv1", "C>3", "D^1", "A>2", "H^3", "A<2", "I<2", "J<2", "Dv3", "D<1", "E<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

BBCCCoIJoDDoIJAALoEEKoLoooKFFFoGGxoo

17

5,642

1

true

[ "C>1", "F<1", "G^1", "K<1", "Iv1", "H>3", "Dv2", "Dv2", "D<2", "A<2", "I^4", "A>2", "H^1", "I<1", "J<2", "Fv2", "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

GoJoBBGIJooLGIJAALHCCDDLHooKEEFFoKoo

17

1,978

0

false

[ "D<1", "E^1", "F^1", "I>1", "J^1", "L>3", "Gv1", "G<1", "Dv3", "A<2", "H^2", "I<1", "K<1", "Ev3", "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

ooLoBBHJLoCCHJAAMNIKDDMNIKooxOFFGGoO

17

1,470

1

true

[ "C<1", "D^1", "E^1", "F<1", "A<2", "H^2", "L^1", "N>2", "M>2", "Iv1", "Iv1", "I<2", "Dv3", "D<1", "F<1", "G^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

FoxoooFoHCCCAAHIoJGooIoJGDDDoKEEoooK

17

802

1

true

[ "Cv1", "C<1", "F^2", "I^2", "I>2", "Ev1", "A>1", "J>1", "Gv1", "Bv2", "C<2", "E^2", "A>2", "G^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

BBBoHJooGoHJAAGoIKFCCoIKFooDDoxooooo

17

6,761

1

true

[ "Gv1", "Dv1", "J<1", "Fv1", "Cv1", "B>3", "C^1", "A>1", "F^3", "A<1", "G<1", "J<2", "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

JBBLoxJDDLoMAAKooMEEKooMooxoGGooHHII

17

9,502

2

true

[ "Dv2", "C>2", "I<1", "J<1", "K<1", "Ev2", "D>3", "E^2", "A>1", "G>1", "Bv3", "A<1", "Bv1", "B<3", "C^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

xooxoKHDDDoKHAAJooEEoJooooIFFFGGIooo

17

4,321

2

true

[ "Bv2", "C>2", "G^1", "I>3", "Gv1", "F>1", "Bv3", "A<1", "E<1", "G^4", "A>1", "F>1", "G^2", "H<3", "Ev1", "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

oHBBBLoHJoKLAAJoKMGICCxMGIEEoMxooooo

17

1,053

2

true

[ "Gv1", "Dv1", "C>1", "D^1", "A>1", "G^3", "A<1", "Hv1", "H<2", "K>1", "Dv3", "A>2", "Cv1", "C<2", "E^1", "F^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

oHoooLoHBBKLAAIoKLGoIJCCGDDJooGEEFFF

17

4,692

0

false

[ "E^1", "H^1", "J>3", "Fv1", "Fv1", "A>2", "Bv3", "D<1", "A<1", "E^1", "H^3", "I<1", "J<1", "K<1", "L<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

oooxooCCooLMAAooLMIDDEEMIoJKFFxoJKHH

17

3,726

2

true

[ "B>1", "C^1", "D^1", "A>1", "E^3", "A<1", "F<1", "G>1", "H^2", "I^2", "J<4", "Fv1", "K<3", "Fv2", "H<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

BBBoIooFCCIooFAAIooGHoDDoGHooJEEEooJ

17

2,092

0

false

[ "H<1", "I^1", "J>3", "Fv1", "Fv1", "F<3", "Cv2", "B>3", "C^1", "D>1", "A<2", "I^4", "G>2", "I^1", "J<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

GooJBBGooJKLHAAoKLHCCCKoooIDDxFFIooo

17

12,258

1

true

[ "Cv1", "C<2", "E^1", "F^1", "Gv1", "A<1", "H>2", "I^3", "J<2", "K>1", "Hv1", "H<3", "Dv3", "C>1", "E^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

FoooIoFBBoIJAAGooJCCGoooooHoxoEEHooo

17

5,484

1

true

[ "Cv2", "C>2", "D^1", "E^2", "A>1", "H^1", "I>3", "Hv1", "G>1", "Bv4", "A<1", "F<1", "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

BBBCCLHooJKLHAAJKoHDDoKoooIooxFFIGGo

17

702

1

true

[ "Dv1", "C>1", "B>1", "D^1", "Ev2", "G<1", "I^1", "K<1", "Ev2", "A>2", "G^2", "G>1", "Bv1", "B<1", "C<1", "F^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

xoJKCCDDJKLMHIAALMHIEEEMHooooooxoGGG

17

768

2

true

[ "Hv1", "Hv1", "A<2", "Bv1", "Bv1", "B<3", "E^1", "F^1", "G^1", "J>1", "Gv2", "A>3", "I^2", "J<1", "K<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

ooxKCCDDoKoLAAoooLEEEFFLJooGGGJHHHII

17

982

1

true

[ "Bv1", "B<1", "C>1", "E^1", "A>1", "G>1", "F>1", "H^3", "G<1", "H<1", "I<1", "J<1", "K<1", "Cv3", "B>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

oHBBCCoHIooKAAIoJKoDDoJoxFFoJoGGoooo

17

10,939

1

true

[ "Fv2", "F^1", "G<1", "I>2", "J>3", "Ev3", "A>2", "F>2", "Bv4", "B<2", "A<2", "E<2", "H^4", "I<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

oooHBBoGoHJooGAAJooGCCDDoooIxKFFoIoK

17

289

1

true

[ "D^1", "F<1", "G<1", "I^3", "H>1", "I^1", "J>4", "Hv1", "G>1", "Bv3", "A<1", "Bv1", "B<3", "C^1", "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

oBBBxoDDIJoKAAIJoKHEEJoxHoooooHGGGoo

17

536

2

true

[ "B<1", "E^1", "F^1", "H>2", "I>2", "Fv3", "E>1", "A>1", "G<2", "Cv1", "B>1", "F^3", "G<1", "H^1", "I<3", "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

BBBoCCoxEEMooAALMooFFLGGooKHHNxoKJJN

17

1,398

2

true

[ "C<1", "A<1", "G<1", "I^2", "J<3", "L<2", "Gv2", "H<1", "K^4", "I>1", "K^1", "L>3", "Gv2", "Hv1", "H<2", "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

BBBCCNDDEEENJAAoMNJFFoMoKLGGHHKLooII

17

334

0

false

[ "A>1", "I>1", "K^2", "L<1", "M<1", "N<1", "Dv3", "C>1", "B>1", "E>1", "D>1", "F^2", "K^2", "L<1", "M<1", "Iv1", "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

oooGoxooFGooAAFHooCCFHoIoEDDoIoEoooo

17

1,754

1

true

[ "C^1", "F^1", "H>2", "Dv2", "E>3", "Bv3", "A>2", "F^4", "A<2", "E^3", "F<3", "G^2", "H<4", "Cv3", "Dv1", "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

oJoBBBxJoKoMAAoKLMDDEELMIFFFooIGGGxo

17

446

2

true

[ "C<1", "E^1", "A>1", "F^1", "H>2", "G>1", "I^2", "J<1", "K<1", "Ev3", "A>1", "Bv1", "B<1", "E^1", "H<1", "Dv3", "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

oBBCCoooLDDxAALMooKFFMoNKGGHHNxJJJoo

17

10,982

2

true

[ "B<1", "C>1", "D^1", "I^1", "K>1", "Fv1", "A>3", "G^2", "H<1", "J<1", "Cv3", "E<2", "A<2", "I^3", "K<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

HIBBMNHIJKMNAAJKoooooLCCooxLooEEFFox

17

2,000

2

true

[ "Ev1", "Ev1", "D>2", "E^1", "F^1", "A>2", "Bv3", "Bv3", "A<2", "Bv1", "Bv1", "B<4", "C^1", "D^1", "E^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

BBBooLIoxDDLIAAKoLIooKEEJxGGooJHHHoo

17

1,633

2

true

[ "B>1", "D^1", "H^1", "I>2", "J<1", "Fv2", "G<3", "H^2", "I<1", "Dv3", "D>1", "J>1", "Fv1", "Bv1", "B<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

xoHCCLooHIKLGAAIKMGDDoKMxooJoooooJFF

17

6,104

2

true

[ "G^1", "Hv1", "Dv1", "C>1", "E^1", "H<1", "J^1", "K<2", "Fv2", "A>2", "Bv3", "A<2", "Bv1", "B<3", "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

BBCCJoooxIJoAAHIooGoHEEEGFFooKGooooK

17

2,136

1

true

[ "Dv1", "C>1", "B>1", "I>2", "Fv2", "A>1", "F^3", "G<3", "J^4", "J>1", "Fv3", "G>1", "Bv1", "B<1", "C<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

ooIBBBooIJCCoAAJooxooJEEFFGGoKoHHHoK

17

5,588

1

true

[ "A<1", "Bv1", "B<3", "D^1", "F<3", "I^2", "I>2", "J<1", "Cv3", "B>3", "C^1", "D<1", "A>3", "Bv1", "B<1", "E^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

oxKCCCooKLDDAAKLoMoxFFoMoGGoHHoIIoJJ

17

3,333

2

true

[ "H<1", "I<1", "J<1", "K<1", "Fv2", "F>2", "Bv3", "B<1", "Cv1", "C<3", "D^1", "F<1", "I^4", "G>1", "I>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

BBBooLooxDDLAAIooLHoIJKoHEEJKooFFGGG

17

4,525

1

true

[ "B>1", "G^1", "H^1", "I>2", "Ev1", "A>1", "G^3", "A<1", "H^1", "I<3", "Fv1", "Fv1", "Fv1", "J<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

BBCCCoxEELoMJAALoMJoKFFMJoKoGGoxIIoo

17

3,339

2

true

[ "C>1", "Gv1", "A<1", "J<1", "Fv2", "K>1", "Gv1", "G<2", "Ev1", "D>3", "E^1", "G>2", "I^4", "H<2", "J<2", "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

GIoKBBGIJKoMHIJAAMHooCCoHDDoLxFFFoLo

17

11,366

1

true

[ "F^1", "A<1", "I<1", "K^3", "J>1", "K>2", "L>2", "Cv3", "Hv1", "A<2", "Cv3", "Cv1", "C<3", "D^1", "E^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

ooBBBKoCCoJKAAooJLHDDoJLHxIFFLGGIooo

17

8,801

1

true

[ "B<1", "D<1", "E^1", "Fv1", "Dv1", "G>2", "I^3", "H<1", "J<1", "Cv3", "B>2", "D^1", "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

FBBBJLFoIoJLAAIoKLGHCCKoGHooKoDDoxoo

17

794

1

true

[ "Ev3", "Fv1", "Dv1", "C>2", "D^1", "A>2", "G^3", "A<2", "K>1", "Gv1", "G<2", "Dv3", "A>2", "Cv1", "C<2", "E^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

FGBBJKFGHoJKooHAAKoxxIoooooIoooooIEE

17

7,931

2

true

[ "Bv1", "Bv1", "B<2", "G^1", "A<1", "Dv3", "A>1", "Cv1", "B>3", "E^1", "F^1", "A<2", "G^1", "I<3", "Ev3", "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

ooGooJooGCCJxoAAIKDDoHIKoFoHIooFoEEE

17

1,899

1

true

[ "A<1", "J<1", "Fv2", "Cv2", "C>1", "G^3", "A>1", "G>2", "H^4", "A<1", "H<1", "Dv3", "D<1", "F^2", "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

HoIBBxHoIoooHAAKooooJKDDEEJFFLGGGooL

17

1,693

1

true

[ "Bv1", "E^1", "G<1", "J^3", "H>1", "J>1", "Ev2", "A>2", "Bv1", "B<3", "D^1", "A<2", "G^3", "H<1", "J<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

oJoLBBoJKLooAAKLMNCCDDMNIEEoxoIGGGox

17

3,807

2

true

[ "E^1", "A>1", "F^1", "G^1", "I>2", "H>1", "J^4", "A<1", "I<1", "K<1", "Dv3", "L<1", "Dv3", "D<2", "E^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

BBCCooDDDKEEAAoKLoIoFFLoIoJxLoIoJHHo

17

436

1

true

[ "C>2", "B>1", "A>1", "I<1", "Ev1", "D>1", "H^3", "I<1", "J^1", "K<3", "Hv1", "Iv1", "H>1", "Bv2", "D<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

ooIBBLxoIDDLoAAJoooooJEEoHxKoooHoKGG

17

9,206

2

true

[ "A<1", "Bv2", "B<3", "D<2", "F^1", "H^1", "I^1", "J<3", "Hv1", "H<1", "Cv4", "G>1", "Dv1", "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

JooxCCJDDDLoAAooLoEEoKFFGGGKooHHoxoo

17

645

2

true

[ "A>1", "F>1", "Bv2", "C<1", "G^2", "I>1", "J>1", "Fv2", "F<1", "G<2", "Ev3", "F>2", "E>1", "G^2", "H<1", "Dv2", "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

IBBBooIooKoLAAoKoLCCDDoLoJEEFFoJGGHH

17

2,610

0

false

[ "E^1", "A>1", "Bv1", "B<1", "E^1", "A>1", "G>2", "F>2", "H^3", "G<1", "H<1", "I<1", "J<1", "K<1", "L<1", "Dv3", "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

xoooooHooxKoHAAJKoDDIJKoooIEEooFFGGo

17

2,663

2

true

[ "C^1", "G>1", "H<1", "Fv1", "I>1", "Dv2", "D>3", "Cv2", "A<1", "E^4", "E<2", "F^2", "G<3", "Dv1", "I<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

ooIxoxooIJooAAIJoooHoooKGHDDoKGEEFFF

17

3,447

2

true

[ "E^1", "F^1", "G>2", "Cv2", "H<1", "Bv3", "A>2", "C^3", "D^3", "A<2", "E^2", "F^1", "G<4", "Dv2", "Dv1", "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

BBIoooooIxDDAAJooLoHJoKLoHEEKLooFFGG

17

1,887

1

true

[ "H^1", "I>1", "Ev1", "Cv1", "B>3", "C^1", "A>2", "G^3", "A<2", "H^1", "I<3", "Fv1", "Fv1", "J<1", "K<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

BBCCCKoooooKoAAoJLoxEEJLFFIGGLooIHHH

17

459

1

true

[ "A<1", "E^1", "G>1", "I^1", "K<1", "Fv1", "Dv1", "C>1", "F^3", "G<1", "J<1", "Ev2", "A>3", "Cv1", "C<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

BBBoJKCCooJKGHAAJoGHIooxEEIFFooooooo

17

999

1

true

[ "Cv1", "Cv1", "B>3", "C>2", "F^2", "G^2", "A<2", "H^1", "J<1", "Fv2", "E>1", "G^2", "A>3", "Dv1", "D<1", "G^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

BBoIoooHoICCoHAAoJDDDooJEEoooKFFFoxK

17

5,120

1

true

[ "G>2", "H>2", "Dv2", "A<1", "Cv1", "B>4", "C^1", "A>1", "F^3", "A<1", "G<2", "H<1", "Cv3", "C<1", "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

oxHICCxoHIoJGoHAAJGEEEoKoooooKFFoooo

17

1,150

2

true

[ "Fv1", "Hv1", "G>2", "Bv3", "A<3", "F^3", "I>1", "Fv1", "F<3", "Cv4", "C<1", "D^1", "E>3", "F^1", "I<1", "Bv3", "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

BBBCCKHDDJoKHAAJooEEIooxooIGGLooIooL

17

260

1

true

[ "Dv1", "C>1", "B>1", "D^1", "Fv1", "E>2", "A<1", "I^2", "J<3", "Ev2", "A>1", "Bv1", "B<1", "C<1", "F^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

oxCCCLDDEEKLAAJoKMooJFFMxHHooMoIIooo

17

2,310

2

true

[ "Hv1", "Cv1", "B>1", "J>2", "K<1", "Gv2", "G<3", "Ev1", "D>1", "I^4", "J<1", "Gv1", "A>3", "Bv1", "B<1", "F^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

ooBBJLoxDDJLAAoIKoEEEIKoHooIoxHoGGGo

17

1,438

2

true

[ "B<1", "Dv2", "A>1", "J<1", "Fv2", "Cv2", "C>2", "D^2", "G>1", "H^3", "H<1", "J<1", "Cv3", "D<2", "E^2", "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

GIBBoLGIoKoLHAAKoMHCCCoMDDJoooxoJoFF

17

15,427

1

true

[ "L<1", "Hv2", "Ev1", "D>2", "E^1", "A>2", "H>2", "J^2", "J>3", "Cv3", "Gv1", "A<2", "Cv1", "C<3", "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

IBBBKLICCoKLAAJoKoooJDDxoxGGooHHHooo

17

7,239

2

true

[ "Ev1", "I>1", "J>3", "Gv2", "G<3", "H^2", "I<1", "J<2", "Dv3", "C>2", "D>2", "F^2", "A>3", "Cv1", "C<1", "F^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

BBGoooooGxoxAAHIoooFHIoJoFEEoJoooooo

17

2,163

2

true

[ "G^1", "H>2", "Dv1", "Cv1", "B>3", "C^1", "Dv1", "A>2", "E^3", "A<2", "F^1", "G^1", "H<4", "Ev1", "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

oGBBBLoGHIJLAAHIJMFCCIKMFoooKoxoEEoo

17

9,856

1

true

[ "Hv1", "Dv1", "C>1", "D^1", "A>1", "H^3", "A<1", "I<1", "Dv3", "L<1", "Ev2", "A>2", "Cv1", "C<2", "E^1", "F^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

HoxoxoHoDDKLAAIJKLooIJEEoooooMFFFGGM

17

3,891

2

true

[ "C<1", "E^1", "Fv1", "A>1", "F^2", "H<1", "I^1", "K>1", "J>1", "Bv4", "D<1", "A<1", "F^2", "G<3", "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

BBooJKCCDDJKoHAAJooHoIoooxoIoxoooIGG

17

662

2

true

[ "B>2", "Cv2", "Cv2", "D>2", "C>2", "E^2", "A<1", "H^1", "I<3", "Fv1", "A>1", "Bv2", "C<1", "D<1", "Fv1", "F^2", "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

GBBoKLGoHoKLAAHooLoCCCxoooIJooEEIJFF

17

1,234

1

true

[ "Dv1", "C>2", "E^1", "A>1", "Bv3", "A<1", "Bv1", "B<3", "D^1", "E^1", "A>1", "F^2", "G<1", "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

GBBBxoGoooJoGoAAJooxHIEEooHIooFFFIoo

17

396

2

true

[ "Bv1", "B<1", "A<1", "F^3", "H>1", "Dv2", "A<1", "F^2", "G<2", "Ev3", "F>2", "Dv2", "A>1", "D^1", "H<1", "Cv3", "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

ooxooNIKLCCNIKLAANJDDMooJxoMFFJGGHHo

17

2,038

2

true

[ "C^1", "D^1", "G^1", "K<1", "L>1", "Iv1", "H>2", "Ev3", "A<2", "G<2", "I^2", "J<1", "L<1", "Dv3", "D>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

FoxooxFooIKoAAoIKLGDDJKLGoHJooGoHEEo

17

1,501

2

true

[ "C^1", "D^1", "A>1", "E^1", "F^1", "J>1", "Hv1", "G>3", "H^1", "I^1", "J<4", "Gv1", "Gv1", "G<2", "Dv3", "Dv2", "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

oBBIJKCCCIJKGAAoJoGoooooGoHDDxFFHooo

17

12,230

1

true

[ "B<1", "Ev2", "H^1", "J>1", "Fv1", "A<1", "H^1", "I<2", "Cv3", "Cv3", "C>3", "D^2", "A>3", "Cv2", "C<1", "E^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

xCCJooooIJDDAAIoKMGHEEKMGHooLMFFFoLo

17

4,176

1

true

[ "Cv1", "B>3", "C^1", "D^1", "A>2", "Gv1", "H^3", "A<2", "L>1", "Hv1", "H<2", "Cv3", "Cv3", "C<2", "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

xooCCCGooIDDGAAIoJEEEooJooHooJooHFFF

17

1,235

1

true

[ "B<1", "Dv1", "D<3", "E^1", "F^2", "G>3", "Dv3", "D<1", "A<1", "H^3", "G<3", "Fv2", "I<1", "Cv3", "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

IBBCCoIDDDMoAAKoMoJoKLEEJFFLoNooxHHN

17

1,473

1

true

[ "Hv1", "H^1", "K>2", "Gv1", "A>1", "Bv2", "B<1", "C<1", "D<1", "E^1", "G^1", "I<1", "L^4", "J>1", "L>1", "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

ooxCCoDDIJKoAAIJKoooIooooHEEoooHFFGG

17

5,245

1

true

[ "B>1", "Ev1", "Ev1", "G^1", "H>1", "I<2", "Dv2", "C>4", "D^2", "A>2", "F^3", "A<2", "G^2", "H<3", "Ev2", "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

oooJooxCCJooooIAAKDDIooKoHEEEKoHFFGG

17

5,089

1

true

[ "E^1", "H>1", "Ev1", "A<3", "Bv2", "B>2", "F^3", "H<1", "Dv1", "C>1", "D^2", "F>2", "G^1", "I<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

GBBoooGoCCxKGoAAJKooHIJoooHIEEFFFIoo

17

14,831

1

true

[ "Bv2", "B<1", "C<2", "D^1", "A<1", "H^2", "J>1", "Fv1", "A<1", "H^3", "A>1", "H^1", "I<3", "Hv1", "J<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

ooooJooooxJKAAoIJKGCCIDDGHEEooGHFFoo

17

2,574

1

true

[ "C^1", "I>2", "J>2", "Dv2", "A>2", "D^3", "E>1", "G^4", "A<1", "F<2", "H^2", "I<3", "J<3", "Fv2", "G<2", "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

KoxoCCKDDDMoAAoLMoEEoLFFGGxooNIIIJJN

17

757

2

true

[ "C<1", "A>1", "G>1", "Bv2", "C<1", "F^1", "H<1", "J^4", "I>1", "L>1", "Ev3", "D>1", "F^1", "G<1", "H<2", "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

oDBBGIoDoEGIAAoEHJCCCFHJoooFoooooooo

17

3,860

0

false

[ "Gv2", "Dv1", "Gv1", "Dv1", "C>2", "D^1", "A>2", "Hv1", "G>2", "Bv3", "A<1", "Bv1", "B<3", "C^1", "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

BBICCLDDIoKLGHAAKLGHoJooGEEJoooooJFF

17

21,497

0

false

[ "Ev1", "D>1", "Fv2", "A>1", "Cv2", "B>2", "D>2", "F^1", "G^2", "K<1", "Hv1", "A<2", "I^1", "L<3", "Gv2", "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

oooLBBxKoLMoIKAAMoIKDDEEJFFooNJGGHHN

17

831

1

true

[ "D^1", "G<1", "H<1", "J>1", "K^3", "I>1", "H>1", "M>1", "L>1", "Bv3", "A<1", "Bv1", "B<3", "C^1", "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

ooxCCoIDDDooIAAKooEEJKooooJFFFooxHHo

17

2,064

2

true

[ "B>1", "C^1", "D>2", "A<1", "G^2", "H<3", "I>1", "Fv2", "F>4", "H^2", "H>3", "Dv2", "A>1", "Bv2", "C<3", "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

xoGoooFoGCCKFoAAIKDDoHIooooHJoEEEHJo

17

8,297

1

true

[ "E^1", "A<1", "G>1", "H^1", "J>1", "Dv3", "A<1", "G<1", "Bv2", "C<3", "D^2", "F^2", "G>1", "H^1", "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

oGBBJooGHIJoAAHIKooooxKoooxoKooEEFFo

17

248

2

true

[ "H<1", "I<1", "Gv1", "Dv1", "C>2", "D^1", "E^1", "A>2", "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

oooxCCoooHooAAoHoIoGDDoIoGEEoIFFoooo

17

2,420

1

true

[ "D^1", "G>2", "H>4", "Ev1", "E<1", "Cv3", "A>2", "D>1", "E^4", "A<1", "E<1", "F^2", "G<3", "Ev1", "H<1", "Dv2", "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

ooEFooooEFGHAAEFGHCDoooICDBBoIoooooo

17

9,305

0

false

[ "D^1", "E^1", "H^1", "I>2", "Bv3", "Bv3", "A>2", "E^3", "F^3", "A<2", "G^2", "H^2", "I<4", "Fv2", "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

oHBBoxoHIoooAAIooKxoIJoKGEEJoKGFFFoo

17

2,182

2

true

[ "E^1", "F^1", "H>3", "Fv1", "I>2", "Dv2", "A>2", "Bv3", "B<1", "A<1", "F^3", "A>2", "F^1", "H<1", "I<1", "Dv2", "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...