question stringlengths 262 3.84k | answer stringlengths 1 4.06k | metadata stringlengths 104 9.07k | dataset_source stringclasses 15
values |
|---|---|---|---|
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 0, "board_config": "oxCCDDooxoMoIoAAMoIoKLFFJoKLooJGGHHH", "min_moves": 10, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 1, "board_config": "FCCDDDFooooIGoxAAIGoHoooooHEEEoooooo", "min_moves": 6, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 2, "board_config": "HBBJKLHooJKLAAIJooooICCCooxEEoFFFGGo", "min_moves": 30, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 3, "board_config": "HoJBBxHoJKDDIAAKoLIEEEoLFFGGoLoooooo", "min_moves": 21, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 4, "board_config": "ooIBBooGIoKooGAAKoFGJCCoFHJoooFHDDEE", "min_moves": 8, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 5, "board_config": "oKBBBxIKoLDDIAALMoIoEEMNJoxGGNJHHHoo", "min_moves": 26, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 6, "board_config": "BBKCCoDDKoMoIJAAMoIJEEMxIooLGGHHoLoo", "min_moves": 45, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 7, "board_config": "BBBFooCCCFoooAAFooooEoooooEDDDoooooo", "min_moves": 8, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 8, "board_config": "BBJKCCoIJKLooIAALMDDooxMFFoooMooxHHo", "min_moves": 36, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 9, "board_config": "oGCCKLoGoJKLxAAJoMDDIJoMFHIoooFHEEEo", "min_moves": 19, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 10, "board_config": "BBoIKLooxIKLAAHJKLoGHJoooGDDoooEEFFo", "min_moves": 21, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 11, "board_config": "oooHooooxHIoAAGHIoooGoJooFCCJooFDDxo", "min_moves": 17, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 12, "board_config": "ooBBBIooooHIAAooHICCCoHooGDDEEoGoFFo", "min_moves": 12, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 13, "board_config": "ooBBBKxoDDDKAAoIJKoooIJoooEExoooGGHH", "min_moves": 9, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 14, "board_config": "oEBBBooEooFoAAooFoooCCCoooDDDooooooo", "min_moves": 4, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 15, "board_config": "oFBBBooFoCCHoFAAGHooooGoDDDEEooooooo", "min_moves": 6, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 16, "board_config": "oBBCCKxooooKHAAJoLHEEJoLooIJFFGGIooo", "min_moves": 16, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 17, "board_config": "GBBoKoGoJoKLAAJooLCCJooMHIDDDMHIEExo", "min_moves": 18, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 18, "board_config": "ooxCCKDDDEEKooAAoLHoIFFLHoIJGGoooJoo", "min_moves": 23, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
Move the red car (AA) to the exit on the right.
Specify moves in the format: 'F+1 K+1 M-1 C+3 H+2 ...'
where the letter is the vehicle and +/- number is spaces to move right/left or down/up.
Walls are marked with an 'x'. Cars cannot move through walls, and walls cannot be moved.
A car oriented vertically can only move ... | None | {"source_dataset": "rush_hour", "source_index": 19, "board_config": "BBBCCoooJKDDAAJKLMIoEELMIFFooNGGHHHN", "min_moves": 36, "difficulty": {"min_moves": [1, 50]}} | rush_hour |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + +
+ X X @ - +
+ - X - - +
+ @ - @ - +
+ % @ - - +
+ + + + +... | UURRRULDRDLDLU | {"gamestr": "+ + + + + + \n+ X X @ - + \n+ - X - - + \n+ @ - @ - + \n+ % @ - - + \n+ + + + + + \n\n", "width": 6, "height": 6, "difficulty": {"source_dataset": "sokoban", "source_index": 0, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + +
+ - - - * +
+ @ @ @ @ +
+ X - - - +
+ - - - X +
+ X - $ X... | DDUULDDRDLLULDURRUULDULDRRDDLURUULLDRRURDD | {"gamestr": "+ + + + + + \n+ - - - * + \n+ @ @ @ @ + \n+ X - - - + \n+ - - - X + \n+ X - $ X + \n+ + - - - + \n+ + + + + + \n\n", "width": 6, "height": 8, "difficulty": {"source_dataset": "sokoban", "source_index": 1, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + + + + + +
+ $ + + + X - @ - +
+ + + + + X @ @ - +
+ X + + X - -... | ULULULRDRDDLUUUURRRUULLDDUURDLDLDRLDDDLLULLUUDRRDRDRUUURUL | {"gamestr": "+ + + + + + + + + + \n+ $ + + + X - @ - + \n+ + + + + X @ @ - + \n+ X + + X - - X - + \n+ - + X @ - - X - + \n+ @ - - X @ - - - + \n+ - - - @ - @ - - + \n+ - - - - - - * - + \n+ + + + + + + + + + \n\n", "width": 10, "height": 9, "difficulty": {"source_dataset": "sokoban", "source_index": 2, "width... | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + +
+ + - * - +
+ $ $ @ @ +
+ X - - X +
+ X @ - - +
+ - - - -... | DDDLRDDLDDRUUUURULLRUURD | {"gamestr": "+ + + + + + \n+ + - * - + \n+ $ $ @ @ + \n+ X - - X + \n+ X @ - - + \n+ - - - - + \n+ - - - - + \n+ - - - - + \n+ - - @ X + \n+ + + + + + \n\n", "width": 6, "height": 10, "difficulty": {"source_dataset": "sokoban", "source_index": 3, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + +
+ X - - - +
+ + - - - +
+ - - @ - +
+ - - - - +
+ - X @ -... | RURRUUULDDUUULDRDDRDLUUULLDRURRDDLUUURULL | {"gamestr": "+ + + + + + \n+ X - - - + \n+ + - - - + \n+ - - @ - + \n+ - - - - + \n+ - X @ - + \n+ $ $ - - + \n+ * @ X - + \n+ + + + + + \n\n", "width": 6, "height": 9, "difficulty": {"source_dataset": "sokoban", "source_index": 4, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + + + +
+ X + $ X @ * +
+ - - - - - @ +
+ @ - $ - - - +
+ - - -... | LRDDLLULLDDLUU | {"gamestr": "+ + + + + + + + \n+ X + $ X @ * + \n+ - - - - - @ + \n+ @ - $ - - - + \n+ - - - - - X + \n+ + + + + + + + \n\n", "width": 8, "height": 6, "difficulty": {"source_dataset": "sokoban", "source_index": 5, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + + + + + +
+ - X - - @ - + + +
+ - @ X - - - + + +
+ - - - - - -... | RUDLUUULLUURRRDRRULLLRDDDULLLDRRULLUURDDRRUUL | {"gamestr": "+ + + + + + + + + + \n+ - X - - @ - + + + \n+ - @ X - - - + + + \n+ - - - - - - + + + \n+ - $ - X + - + + + \n+ - - @ $ + - + + + \n+ - $ * @ X - $ + + \n+ + + + + + + + + + \n\n", "width": 10, "height": 8, "difficulty": {"source_dataset": "sokoban", "source_index": 6, "width": [6, 10], "height": [... | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + +
+ + - - - +
+ - - - $ +
+ X @ - + +
+ - - - + +
+ @ - - +... | UURRUULDDRDLULD | {"gamestr": "+ + + + + + \n+ + - - - + \n+ - - - $ + \n+ X @ - + + \n+ - - - + + \n+ @ - - + + \n+ % $ $ + + \n+ + + + + + \n\n", "width": 6, "height": 8, "difficulty": {"source_dataset": "sokoban", "source_index": 7, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + + + +
+ X - - X * - +
+ - @ @ @ @ - +
+ - - - X - - +
+ - - -... | DULDULLDRLDDLDRRDRRDLURURUUULLLLDLURRDDRUURRDL | {"gamestr": "+ + + + + + + + \n+ X - - X * - + \n+ - @ @ @ @ - + \n+ - - - X - - + \n+ - - - - $ - + \n+ - - - X - - + \n+ + - - - - - + \n+ $ + X @ - - + \n+ + + + + + + + \n\n", "width": 8, "height": 9, "difficulty": {"source_dataset": "sokoban", "source_index": 8, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + + +
+ $ + - - X +
+ - - - - - +
+ - - - @ - +
+ - X - @ - + ... | UDLULUULUURRDLURDRUULLDDDDDLDRR | {"gamestr": "+ + + + + + + \n+ $ + - - X + \n+ - - - - - + \n+ - - - @ - + \n+ - X - @ - + \n+ - - - X - + \n+ - - @ X X + \n+ - - - @ @ + \n+ - - - @ % + \n+ + + + + + + \n\n", "width": 7, "height": 10, "difficulty": {"source_dataset": "sokoban", "source_index": 9, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + + + +
+ X X @ - @ - +
+ - - X X @ - +
+ - - - $ @ - +
+ - * -... | UURRULLRDDDRRRUULLRRULLLRRDRDDLURUL | {"gamestr": "+ + + + + + + + \n+ X X @ - @ - + \n+ - - X X @ - + \n+ - - - $ @ - + \n+ - * - - - - + \n+ + + + + + + + \n\n", "width": 8, "height": 6, "difficulty": {"source_dataset": "sokoban", "source_index": 10, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + + + + + +
+ * @ X + + - - + +
+ $ - + + - @ - + +
+ $ - $ X - -... | RDDRLDRRRULRRRUULDRDLL | {"gamestr": "+ + + + + + + + + + \n+ * @ X + + - - + + \n+ $ - + + - @ - + + \n+ $ - $ X - - - + + \n+ $ - @ - - X - - + \n+ - - - - - - - - + \n+ + + + + + + + + + \n\n", "width": 10, "height": 7, "difficulty": {"source_dataset": "sokoban", "source_index": 11, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + + +
+ - - - $ - +
+ - X - @ - +
+ - - - * - +
+ - $ X X - + ... | RULLDDRRDDLUDDLUUDDLLURRDRU | {"gamestr": "+ + + + + + + \n+ - - - $ - + \n+ - X - @ - + \n+ - - - * - + \n+ - $ X X - + \n+ + - - $ - + \n+ - @ @ - - + \n+ - - - - - + \n+ + + + + + + \n\n", "width": 7, "height": 9, "difficulty": {"source_dataset": "sokoban", "source_index": 12, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + +
+ + X @ * +
+ + - - @ +
+ $ - - X +
+ + + + + +
+ + + + $... | LRD | {"gamestr": "+ + + + + + \n+ + X @ * + \n+ + - - @ + \n+ $ - - X + \n+ + + + + + \n+ + + + $ + \n+ + + + + + \n\n", "width": 6, "height": 7, "difficulty": {"source_dataset": "sokoban", "source_index": 13, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + + + + + +
+ X - @ - $ * + + +
+ - @ X - - @ - + +
+ - X - @ - -... | DDLLLURULLRDRRDDRLLDRDDUUURDLDLLUULLDRDUURDULLUURDRRRRDDLDDRUUULUURRDLLLL | {"gamestr": "+ + + + + + + + + + \n+ X - @ - $ * + + + \n+ - @ X - - @ - + + \n+ - X - @ - - - + + \n+ - X - - @ - X + + \n+ - @ - - - - + + + \n+ - @ X - @ - - - + \n+ + X - $ - - - - + \n+ + + + + X - - - + \n+ + + + + + + + + + \n\n", "width": 10, "height": 10, "difficulty": {"source_dataset": "sokoban", "... | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + +
+ - $ + $ +
+ - - - + +
+ - @ - + +
+ - - X X +
+ - @ X @... | ULUUULDLDRLDR | {"gamestr": "+ + + + + + \n+ - $ + $ + \n+ - - - + + \n+ - @ - + + \n+ - - X X + \n+ - @ X @ + \n+ - - - * + \n+ + + + + + \n\n", "width": 6, "height": 8, "difficulty": {"source_dataset": "sokoban", "source_index": 15, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + + + + + +
+ - - - X - - - $ +
+ - - @ - @ - - + +
+ - X - - X -... | ULLUURDULLDLULULDRRRDLDDRU | {"gamestr": "+ + + + + + + + + + \n+ - - - X - - - $ + \n+ - - @ - @ - - + + \n+ - X - - X - @ X + \n+ - - - - - - $ @ + \n+ - - - - - - $ * + \n+ + + + + + + + + + \n\n", "width": 10, "height": 7, "difficulty": {"source_dataset": "sokoban", "source_index": 16, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + + +
+ - @ - - X +
+ - - X @ - +
+ - X - @ * +
+ - - - $ - + ... | LLULLURRRLDDRRUL | {"gamestr": "+ + + + + + + \n+ - @ - - X + \n+ - - X @ - + \n+ - X - @ * + \n+ - - - $ - + \n+ + + + + + + \n\n", "width": 7, "height": 6, "difficulty": {"source_dataset": "sokoban", "source_index": 17, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + + + +
+ - - - - * X +
+ + $ - @ - - +
+ $ X - - @ - +
+ X - -... | LDDRDRUULDDRDLLDLULRUDLDLURUURURRDLL | {"gamestr": "+ + + + + + + + \n+ - - - - * X + \n+ + $ - @ - - + \n+ $ X - - @ - + \n+ X - - X - - + \n+ - @ - - @ - + \n+ - - - - - - + \n+ + + + + + + + \n\n", "width": 8, "height": 8, "difficulty": {"source_dataset": "sokoban", "source_index": 18, "width": [6, 10], "height": [6, 10]}} | sokoban |
You are going to solve a 'sokoban' puzzle.
* - The player
% - The player on a goal
@ - A box
X - A goal
$ - A box on a goal
+ - A wall
- - An empty position
Your solution must be a string of characters, ex: LDURRUDL.
Here is your puzzle:
+ + + + + + + + +
+ - @ - X X - - +
+ - @ X - @ @ - +
+ - @ X - - - X + ... | UURLURLURRRDDRRRUULLRDULDDRDDLUUU | {"gamestr": "+ + + + + + + + + \n+ - @ - X X - - + \n+ - @ X - @ @ - + \n+ - @ X - - - X + \n+ - - $ - - - - + \n+ * - - - - - - + \n+ + + + + + + + + \n\n", "width": 9, "height": 7, "difficulty": {"source_dataset": "sokoban", "source_index": 19, "width": [6, 10], "height": [6, 10]}} | sokoban |
Solve this Sudoku puzzle:
4 _ _ _ 9 2 _ 3 _
_ _ 3 4 6 _ _ _ 7
6 1 2 _ _ 7 8 _ _
2 _ _ _ _ _ 7 9 1
8 _ _ 7 1 _ _ 5 6
1 _ _ 5 _ _ _ _ 3
9 _ 4 _ 7 1 _ _ _
_ 8 _ _ _ _ _ _ _
_ _ _ 9 8 _ _ _ 4
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 4 7 8 1 9 2 6 3 5
5 9 3 4 6 8 1 2 7
6 1 2 3 5 7 8 4 9
2 4 5 8 3 6 7 9 1
8 3 9 7 1 4 2 5 6
1 6 7 5 2 9 4 8 3
9 5 4 2 7 1 3 6 8
3 8 1 6 4 5 9 7 2
7 2 6 9 8 3 5 1 4 | {"source_dataset": "sudoku", "source_index": 0, "puzzle": [[4, 0, 0, 0, 9, 2, 0, 3, 0], [0, 0, 3, 4, 6, 0, 0, 0, 7], [6, 1, 2, 0, 0, 7, 8, 0, 0], [2, 0, 0, 0, 0, 0, 7, 9, 1], [8, 0, 0, 7, 1, 0, 0, 5, 6], [1, 0, 0, 5, 0, 0, 0, 0, 3], [9, 0, 4, 0, 7, 1, 0, 0, 0], [0, 8, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 9, 8, 0, 0, 0, 4]],... | sudoku |
Solve this Sudoku puzzle:
_ _ _ 1 3 2 6 4 5
_ 4 _ 8 5 _ _ 9 _
_ _ 1 9 _ 7 _ _ _
_ 8 9 6 _ _ 7 5 4
_ 3 _ 4 _ 1 9 8 _
4 6 _ 5 9 _ 2 3 1
5 _ 4 7 1 9 3 _ _
9 7 6 _ _ 4 5 1 _
8 _ 3 _ _ _ 4 7 _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 7 9 8 1 3 2 6 4 5
3 4 2 8 5 6 1 9 7
6 5 1 9 4 7 8 2 3
1 8 9 6 2 3 7 5 4
2 3 5 4 7 1 9 8 6
4 6 7 5 9 8 2 3 1
5 2 4 7 1 9 3 6 8
9 7 6 3 8 4 5 1 2
8 1 3 2 6 5 4 7 9 | {"source_dataset": "sudoku", "source_index": 1, "puzzle": [[0, 0, 0, 1, 3, 2, 6, 4, 5], [0, 4, 0, 8, 5, 0, 0, 9, 0], [0, 0, 1, 9, 0, 7, 0, 0, 0], [0, 8, 9, 6, 0, 0, 7, 5, 4], [0, 3, 0, 4, 0, 1, 9, 8, 0], [4, 6, 0, 5, 9, 0, 2, 3, 1], [5, 0, 4, 7, 1, 9, 3, 0, 0], [9, 7, 6, 0, 0, 4, 5, 1, 0], [8, 0, 3, 0, 0, 0, 4, 7, 0]],... | sudoku |
Solve this Sudoku puzzle:
_ _ 1 9 2 _ _ _ 3
3 _ _ 1 7 5 8 2 6
_ _ _ 4 3 6 1 _ _
1 _ 5 7 _ _ 9 3 _
_ 4 _ _ 5 9 7 1 8
7 _ 9 _ 1 _ 6 4 5
_ _ 3 5 9 _ 2 8 4
_ _ 2 6 8 _ _ 9 1
_ 5 _ 2 4 1 3 _ _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 5 6 1 9 2 8 4 7 3
3 9 4 1 7 5 8 2 6
8 2 7 4 3 6 1 5 9
1 8 5 7 6 4 9 3 2
2 4 6 3 5 9 7 1 8
7 3 9 8 1 2 6 4 5
6 1 3 5 9 7 2 8 4
4 7 2 6 8 3 5 9 1
9 5 8 2 4 1 3 6 7 | {"source_dataset": "sudoku", "source_index": 2, "puzzle": [[0, 0, 1, 9, 2, 0, 0, 0, 3], [3, 0, 0, 1, 7, 5, 8, 2, 6], [0, 0, 0, 4, 3, 6, 1, 0, 0], [1, 0, 5, 7, 0, 0, 9, 3, 0], [0, 4, 0, 0, 5, 9, 7, 1, 8], [7, 0, 9, 0, 1, 0, 6, 4, 5], [0, 0, 3, 5, 9, 0, 2, 8, 4], [0, 0, 2, 6, 8, 0, 0, 9, 1], [0, 5, 0, 2, 4, 1, 3, 0, 0]],... | sudoku |
Solve this Sudoku puzzle:
_ 9 2 3 1 4 _ 7 _
6 _ 3 8 7 _ 9 _ _
4 _ _ _ 9 6 3 _ 1
1 _ 7 _ 4 9 _ _ 3
_ 5 _ 6 3 7 4 _ _
3 _ 6 _ 8 2 _ 5 _
5 _ 8 _ 6 3 1 4 7
7 _ 1 4 _ _ _ _ 6
9 6 4 7 _ _ 8 3 2
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 8 9 2 3 1 4 6 7 5
6 1 3 8 7 5 9 2 4
4 7 5 2 9 6 3 8 1
1 8 7 5 4 9 2 6 3
2 5 9 6 3 7 4 1 8
3 4 6 1 8 2 7 5 9
5 2 8 9 6 3 1 4 7
7 3 1 4 2 8 5 9 6
9 6 4 7 5 1 8 3 2 | {"source_dataset": "sudoku", "source_index": 3, "puzzle": [[0, 9, 2, 3, 1, 4, 0, 7, 0], [6, 0, 3, 8, 7, 0, 9, 0, 0], [4, 0, 0, 0, 9, 6, 3, 0, 1], [1, 0, 7, 0, 4, 9, 0, 0, 3], [0, 5, 0, 6, 3, 7, 4, 0, 0], [3, 0, 6, 0, 8, 2, 0, 5, 0], [5, 0, 8, 0, 6, 3, 1, 4, 7], [7, 0, 1, 4, 0, 0, 0, 0, 6], [9, 6, 4, 7, 0, 0, 8, 3, 2]],... | sudoku |
Solve this Sudoku puzzle:
_ _ _ _ 9 _ _ 6 7
9 _ 5 _ 7 8 1 _ _
1 7 2 _ 6 _ 9 3 _
_ 3 7 _ _ _ _ _ 1
_ 1 _ 6 _ _ 2 8 _
2 _ 6 8 1 _ _ 7 _
_ 9 4 _ 8 1 7 2 _
_ 5 8 9 2 _ 4 _ 3
_ 2 _ _ _ _ _ _ 9
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 4 8 3 1 9 2 5 6 7
9 6 5 3 7 8 1 4 2
1 7 2 4 6 5 9 3 8
8 3 7 2 5 4 6 9 1
5 1 9 6 3 7 2 8 4
2 4 6 8 1 9 3 7 5
3 9 4 5 8 1 7 2 6
7 5 8 9 2 6 4 1 3
6 2 1 7 4 3 8 5 9 | {"source_dataset": "sudoku", "source_index": 4, "puzzle": [[0, 0, 0, 0, 9, 0, 0, 6, 7], [9, 0, 5, 0, 7, 8, 1, 0, 0], [1, 7, 2, 0, 6, 0, 9, 3, 0], [0, 3, 7, 0, 0, 0, 0, 0, 1], [0, 1, 0, 6, 0, 0, 2, 8, 0], [2, 0, 6, 8, 1, 0, 0, 7, 0], [0, 9, 4, 0, 8, 1, 7, 2, 0], [0, 5, 8, 9, 2, 0, 4, 0, 3], [0, 2, 0, 0, 0, 0, 0, 0, 9]],... | sudoku |
Solve this Sudoku puzzle:
_ _ 8 _ 3 _ 6 4 _
_ _ _ 4 6 8 _ 9 _
_ _ _ 1 _ _ _ 3 5
_ _ _ 3 _ 6 _ 7 _
_ _ _ _ _ 4 9 2 1
2 5 4 _ 1 _ _ 8 _
_ 8 1 _ _ _ _ _ _
_ 6 2 _ 9 _ 4 _ 3
_ _ 3 6 5 2 _ 1 _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 1 9 8 2 3 5 6 4 7
3 7 5 4 6 8 1 9 2
4 2 6 1 7 9 8 3 5
8 1 9 3 2 6 5 7 4
6 3 7 5 8 4 9 2 1
2 5 4 9 1 7 3 8 6
5 8 1 7 4 3 2 6 9
7 6 2 8 9 1 4 5 3
9 4 3 6 5 2 7 1 8 | {"source_dataset": "sudoku", "source_index": 5, "puzzle": [[0, 0, 8, 0, 3, 0, 6, 4, 0], [0, 0, 0, 4, 6, 8, 0, 9, 0], [0, 0, 0, 1, 0, 0, 0, 3, 5], [0, 0, 0, 3, 0, 6, 0, 7, 0], [0, 0, 0, 0, 0, 4, 9, 2, 1], [2, 5, 4, 0, 1, 0, 0, 8, 0], [0, 8, 1, 0, 0, 0, 0, 0, 0], [0, 6, 2, 0, 9, 0, 4, 0, 3], [0, 0, 3, 6, 5, 2, 0, 1, 0]],... | sudoku |
Solve this Sudoku puzzle:
7 1 _ _ _ _ 3 6 _
3 _ _ 1 _ 4 _ 9 7
2 _ 9 3 7 5 _ 4 _
1 _ _ 9 5 _ 6 2 _
8 2 3 _ _ _ _ 5 9
9 5 _ _ _ 7 4 8 1
4 9 _ _ _ _ 8 _ _
6 _ 8 7 4 9 _ 1 2
5 _ 2 6 8 1 _ 3 _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 7 1 4 8 9 2 3 6 5
3 8 5 1 6 4 2 9 7
2 6 9 3 7 5 1 4 8
1 4 7 9 5 8 6 2 3
8 2 3 4 1 6 7 5 9
9 5 6 2 3 7 4 8 1
4 9 1 5 2 3 8 7 6
6 3 8 7 4 9 5 1 2
5 7 2 6 8 1 9 3 4 | {"source_dataset": "sudoku", "source_index": 6, "puzzle": [[7, 1, 0, 0, 0, 0, 3, 6, 0], [3, 0, 0, 1, 0, 4, 0, 9, 7], [2, 0, 9, 3, 7, 5, 0, 4, 0], [1, 0, 0, 9, 5, 0, 6, 2, 0], [8, 2, 3, 0, 0, 0, 0, 5, 9], [9, 5, 0, 0, 0, 7, 4, 8, 1], [4, 9, 0, 0, 0, 0, 8, 0, 0], [6, 0, 8, 7, 4, 9, 0, 1, 2], [5, 0, 2, 6, 8, 1, 0, 3, 0]],... | sudoku |
Solve this Sudoku puzzle:
9 7 _ 8 2 1 3 _ 4
8 _ _ 5 _ _ _ _ 7
_ 6 _ _ _ 3 5 _ 1
1 2 _ _ 7 8 _ 5 3
_ 5 _ 2 1 6 _ _ 9
7 _ _ 4 3 _ 2 1 _
_ _ _ 6 8 9 _ _ 5
_ _ _ _ 5 7 8 _ 2
5 _ _ 3 _ _ _ 7 _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 9 7 5 8 2 1 3 6 4
8 3 1 5 6 4 9 2 7
4 6 2 7 9 3 5 8 1
1 2 4 9 7 8 6 5 3
3 5 8 2 1 6 7 4 9
7 9 6 4 3 5 2 1 8
2 1 7 6 8 9 4 3 5
6 4 3 1 5 7 8 9 2
5 8 9 3 4 2 1 7 6 | {"source_dataset": "sudoku", "source_index": 7, "puzzle": [[9, 7, 0, 8, 2, 1, 3, 0, 4], [8, 0, 0, 5, 0, 0, 0, 0, 7], [0, 6, 0, 0, 0, 3, 5, 0, 1], [1, 2, 0, 0, 7, 8, 0, 5, 3], [0, 5, 0, 2, 1, 6, 0, 0, 9], [7, 0, 0, 4, 3, 0, 2, 1, 0], [0, 0, 0, 6, 8, 9, 0, 0, 5], [0, 0, 0, 0, 5, 7, 8, 0, 2], [5, 0, 0, 3, 0, 0, 0, 7, 0]],... | sudoku |
Solve this Sudoku puzzle:
7 _ _ _ _ _ _ 4 6
_ _ 6 _ 1 _ _ 3 _
_ _ 8 _ _ _ _ 2 1
_ _ 2 _ _ _ 6 5 _
_ 4 _ 1 5 _ 2 9 3
_ _ _ _ _ 9 _ _ _
_ 3 1 _ 9 _ _ _ _
2 6 _ 5 3 7 _ _ _
9 7 _ _ 8 1 _ _ _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 7 1 9 8 2 3 5 4 6
4 2 6 9 1 5 8 3 7
3 5 8 7 4 6 9 2 1
1 9 2 3 7 4 6 5 8
6 4 7 1 5 8 2 9 3
5 8 3 2 6 9 7 1 4
8 3 1 6 9 2 4 7 5
2 6 4 5 3 7 1 8 9
9 7 5 4 8 1 3 6 2 | {"source_dataset": "sudoku", "source_index": 8, "puzzle": [[7, 0, 0, 0, 0, 0, 0, 4, 6], [0, 0, 6, 0, 1, 0, 0, 3, 0], [0, 0, 8, 0, 0, 0, 0, 2, 1], [0, 0, 2, 0, 0, 0, 6, 5, 0], [0, 4, 0, 1, 5, 0, 2, 9, 3], [0, 0, 0, 0, 0, 9, 0, 0, 0], [0, 3, 1, 0, 9, 0, 0, 0, 0], [2, 6, 0, 5, 3, 7, 0, 0, 0], [9, 7, 0, 0, 8, 1, 0, 0, 0]],... | sudoku |
Solve this Sudoku puzzle:
1 9 6 8 _ _ _ 5 _
_ _ 7 9 1 _ _ _ _
_ _ _ 6 5 7 8 _ _
3 4 _ 1 7 _ 5 9 6
_ 6 5 _ _ 8 _ _ _
_ _ 1 _ 6 _ 3 _ 4
_ 7 2 3 9 1 6 _ 8
_ _ 9 2 8 _ 7 3 _
_ _ _ _ _ 5 9 _ _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 1 9 6 8 2 3 4 5 7
8 5 7 9 1 4 2 6 3
2 3 4 6 5 7 8 1 9
3 4 8 1 7 2 5 9 6
9 6 5 4 3 8 1 7 2
7 2 1 5 6 9 3 8 4
5 7 2 3 9 1 6 4 8
4 1 9 2 8 6 7 3 5
6 8 3 7 4 5 9 2 1 | {"source_dataset": "sudoku", "source_index": 9, "puzzle": [[1, 9, 6, 8, 0, 0, 0, 5, 0], [0, 0, 7, 9, 1, 0, 0, 0, 0], [0, 0, 0, 6, 5, 7, 8, 0, 0], [3, 4, 0, 1, 7, 0, 5, 9, 6], [0, 6, 5, 0, 0, 8, 0, 0, 0], [0, 0, 1, 0, 6, 0, 3, 0, 4], [0, 7, 2, 3, 9, 1, 6, 0, 8], [0, 0, 9, 2, 8, 0, 7, 3, 0], [0, 0, 0, 0, 0, 5, 9, 0, 0]],... | sudoku |
Solve this Sudoku puzzle:
7 8 _ _ 3 _ _ _ _
_ _ 9 2 5 _ 1 6 _
6 _ 5 _ 4 _ _ _ _
8 _ 3 _ _ _ _ 9 4
1 _ 7 _ _ 4 3 _ 6
4 5 _ 7 _ 3 8 _ 2
_ _ _ _ 7 _ 5 _ 8
5 _ _ 3 _ _ 6 _ 9
2 _ _ _ _ 9 _ 7 _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 7 8 2 1 3 6 9 4 5
3 4 9 2 5 8 1 6 7
6 1 5 9 4 7 2 8 3
8 2 3 6 1 5 7 9 4
1 9 7 8 2 4 3 5 6
4 5 6 7 9 3 8 1 2
9 6 1 4 7 2 5 3 8
5 7 4 3 8 1 6 2 9
2 3 8 5 6 9 4 7 1 | {"source_dataset": "sudoku", "source_index": 10, "puzzle": [[7, 8, 0, 0, 3, 0, 0, 0, 0], [0, 0, 9, 2, 5, 0, 1, 6, 0], [6, 0, 5, 0, 4, 0, 0, 0, 0], [8, 0, 3, 0, 0, 0, 0, 9, 4], [1, 0, 7, 0, 0, 4, 3, 0, 6], [4, 5, 0, 7, 0, 3, 8, 0, 2], [0, 0, 0, 0, 7, 0, 5, 0, 8], [5, 0, 0, 3, 0, 0, 6, 0, 9], [2, 0, 0, 0, 0, 9, 0, 7, 0]]... | sudoku |
Solve this Sudoku puzzle:
_ _ 7 8 _ 9 4 5 _
3 _ 6 1 _ 5 8 2 _
_ 8 4 _ 2 _ 1 3 9
_ _ _ 5 8 _ _ 6 1
_ 4 _ _ 7 3 2 9 5
_ _ 5 2 9 _ 3 8 4
_ 1 9 3 6 2 5 _ _
_ 5 3 _ _ _ 6 4 2
2 6 _ _ _ _ _ 1 _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 1 2 7 8 3 9 4 5 6
3 9 6 1 4 5 8 2 7
5 8 4 7 2 6 1 3 9
9 3 2 5 8 4 7 6 1
8 4 1 6 7 3 2 9 5
6 7 5 2 9 1 3 8 4
4 1 9 3 6 2 5 7 8
7 5 3 9 1 8 6 4 2
2 6 8 4 5 7 9 1 3 | {"source_dataset": "sudoku", "source_index": 11, "puzzle": [[0, 0, 7, 8, 0, 9, 4, 5, 0], [3, 0, 6, 1, 0, 5, 8, 2, 0], [0, 8, 4, 0, 2, 0, 1, 3, 9], [0, 0, 0, 5, 8, 0, 0, 6, 1], [0, 4, 0, 0, 7, 3, 2, 9, 5], [0, 0, 5, 2, 9, 0, 3, 8, 4], [0, 1, 9, 3, 6, 2, 5, 0, 0], [0, 5, 3, 0, 0, 0, 6, 4, 2], [2, 6, 0, 0, 0, 0, 0, 1, 0]]... | sudoku |
Solve this Sudoku puzzle:
6 1 2 _ 9 _ _ _ 7
_ _ 9 1 3 _ 8 _ _
5 _ _ 6 _ _ 4 _ _
_ 2 4 _ _ _ 5 9 6
_ 6 _ _ _ _ _ _ 8
_ 9 7 5 _ _ _ 3 4
_ _ 8 4 7 1 _ _ 3
_ _ _ _ _ 6 9 _ _
4 _ _ _ _ 2 7 _ 1
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 6 1 2 8 9 4 3 5 7
7 4 9 1 3 5 8 6 2
5 8 3 6 2 7 4 1 9
8 2 4 7 1 3 5 9 6
3 6 5 2 4 9 1 7 8
1 9 7 5 6 8 2 3 4
9 5 8 4 7 1 6 2 3
2 7 1 3 8 6 9 4 5
4 3 6 9 5 2 7 8 1 | {"source_dataset": "sudoku", "source_index": 12, "puzzle": [[6, 1, 2, 0, 9, 0, 0, 0, 7], [0, 0, 9, 1, 3, 0, 8, 0, 0], [5, 0, 0, 6, 0, 0, 4, 0, 0], [0, 2, 4, 0, 0, 0, 5, 9, 6], [0, 6, 0, 0, 0, 0, 0, 0, 8], [0, 9, 7, 5, 0, 0, 0, 3, 4], [0, 0, 8, 4, 7, 1, 0, 0, 3], [0, 0, 0, 0, 0, 6, 9, 0, 0], [4, 0, 0, 0, 0, 2, 7, 0, 1]]... | sudoku |
Solve this Sudoku puzzle:
_ 8 _ _ _ _ 4 _ _
_ 3 6 8 5 4 9 _ _
_ 4 2 6 _ 7 8 _ 1
_ 9 4 1 _ _ _ _ _
_ _ _ 9 4 _ 7 _ _
_ _ _ 3 _ _ _ 9 _
5 _ _ _ _ 3 _ _ _
_ 6 7 _ 8 2 3 _ _
_ 2 3 _ 9 _ 5 7 6
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 7 8 5 2 1 9 4 6 3
1 3 6 8 5 4 9 2 7
9 4 2 6 3 7 8 5 1
2 9 4 1 7 8 6 3 5
3 5 1 9 4 6 7 8 2
6 7 8 3 2 5 1 9 4
5 1 9 7 6 3 2 4 8
4 6 7 5 8 2 3 1 9
8 2 3 4 9 1 5 7 6 | {"source_dataset": "sudoku", "source_index": 13, "puzzle": [[0, 8, 0, 0, 0, 0, 4, 0, 0], [0, 3, 6, 8, 5, 4, 9, 0, 0], [0, 4, 2, 6, 0, 7, 8, 0, 1], [0, 9, 4, 1, 0, 0, 0, 0, 0], [0, 0, 0, 9, 4, 0, 7, 0, 0], [0, 0, 0, 3, 0, 0, 0, 9, 0], [5, 0, 0, 0, 0, 3, 0, 0, 0], [0, 6, 7, 0, 8, 2, 3, 0, 0], [0, 2, 3, 0, 9, 0, 5, 7, 6]]... | sudoku |
Solve this Sudoku puzzle:
8 _ 7 1 _ _ 4 _ 9
_ _ _ 9 _ _ _ 7 _
_ 1 _ _ 5 7 3 8 _
1 _ _ _ 8 _ 5 _ 7
9 6 _ 7 1 _ 2 3 _
_ _ 8 _ 2 4 _ _ _
2 _ 5 8 _ _ 6 9 _
_ _ 1 _ 6 _ _ 2 5
6 8 _ _ 9 2 7 _ _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 8 2 7 1 3 6 4 5 9
3 5 6 9 4 8 1 7 2
4 1 9 2 5 7 3 8 6
1 3 2 6 8 9 5 4 7
9 6 4 7 1 5 2 3 8
5 7 8 3 2 4 9 6 1
2 4 5 8 7 1 6 9 3
7 9 1 4 6 3 8 2 5
6 8 3 5 9 2 7 1 4 | {"source_dataset": "sudoku", "source_index": 14, "puzzle": [[8, 0, 7, 1, 0, 0, 4, 0, 9], [0, 0, 0, 9, 0, 0, 0, 7, 0], [0, 1, 0, 0, 5, 7, 3, 8, 0], [1, 0, 0, 0, 8, 0, 5, 0, 7], [9, 6, 0, 7, 1, 0, 2, 3, 0], [0, 0, 8, 0, 2, 4, 0, 0, 0], [2, 0, 5, 8, 0, 0, 6, 9, 0], [0, 0, 1, 0, 6, 0, 0, 2, 5], [6, 8, 0, 0, 9, 2, 7, 0, 0]]... | sudoku |
Solve this Sudoku puzzle:
8 _ 3 _ 1 _ _ _ _
_ _ _ _ 6 _ _ _ 4
5 6 _ _ 4 _ _ 8 2
_ 8 4 2 _ _ _ _ 6
9 _ _ 1 _ _ 3 _ _
_ 7 _ 4 5 _ _ _ _
6 1 _ _ _ _ _ _ _
_ _ 2 6 3 _ _ _ 7
7 _ 8 _ _ _ 4 6 9
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 8 4 3 9 1 2 6 7 5
2 9 7 8 6 5 1 3 4
5 6 1 3 4 7 9 8 2
1 8 4 2 9 3 7 5 6
9 2 5 1 7 6 3 4 8
3 7 6 4 5 8 2 9 1
6 1 9 7 8 4 5 2 3
4 5 2 6 3 9 8 1 7
7 3 8 5 2 1 4 6 9 | {"source_dataset": "sudoku", "source_index": 15, "puzzle": [[8, 0, 3, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 6, 0, 0, 0, 4], [5, 6, 0, 0, 4, 0, 0, 8, 2], [0, 8, 4, 2, 0, 0, 0, 0, 6], [9, 0, 0, 1, 0, 0, 3, 0, 0], [0, 7, 0, 4, 5, 0, 0, 0, 0], [6, 1, 0, 0, 0, 0, 0, 0, 0], [0, 0, 2, 6, 3, 0, 0, 0, 7], [7, 0, 8, 0, 0, 0, 4, 6, 9]]... | sudoku |
Solve this Sudoku puzzle:
_ 5 _ _ 9 _ 7 2 6
1 _ _ 6 8 _ _ 4 5
6 _ 4 2 7 5 _ 3 _
_ _ 5 8 1 2 _ _ _
_ 8 6 5 _ _ 3 1 _
_ 4 _ _ 6 _ 8 5 9
_ _ _ 4 _ 1 5 7 _
_ 1 2 7 _ 8 _ _ _
_ _ 3 _ _ _ 2 _ _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 3 5 8 1 9 4 7 2 6
1 2 7 6 8 3 9 4 5
6 9 4 2 7 5 1 3 8
9 3 5 8 1 2 4 6 7
7 8 6 5 4 9 3 1 2
2 4 1 3 6 7 8 5 9
8 6 9 4 2 1 5 7 3
5 1 2 7 3 8 6 9 4
4 7 3 9 5 6 2 8 1 | {"source_dataset": "sudoku", "source_index": 16, "puzzle": [[0, 5, 0, 0, 9, 0, 7, 2, 6], [1, 0, 0, 6, 8, 0, 0, 4, 5], [6, 0, 4, 2, 7, 5, 0, 3, 0], [0, 0, 5, 8, 1, 2, 0, 0, 0], [0, 8, 6, 5, 0, 0, 3, 1, 0], [0, 4, 0, 0, 6, 0, 8, 5, 9], [0, 0, 0, 4, 0, 1, 5, 7, 0], [0, 1, 2, 7, 0, 8, 0, 0, 0], [0, 0, 3, 0, 0, 0, 2, 0, 0]]... | sudoku |
Solve this Sudoku puzzle:
_ 5 _ 8 _ _ _ _ 6
8 1 9 _ 6 4 2 3 _
_ 2 _ _ 7 3 5 8 _
4 8 _ 6 _ 9 7 1 5
1 _ 2 _ 5 7 _ 6 4
_ _ 6 _ 8 _ 3 _ _
7 _ 1 2 _ _ _ 5 8
2 4 8 _ 3 _ _ 7 9
9 6 5 7 4 8 1 _ 3
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 3 5 7 8 1 2 9 4 6
8 1 9 5 6 4 2 3 7
6 2 4 9 7 3 5 8 1
4 8 3 6 2 9 7 1 5
1 9 2 3 5 7 8 6 4
5 7 6 4 8 1 3 9 2
7 3 1 2 9 6 4 5 8
2 4 8 1 3 5 6 7 9
9 6 5 7 4 8 1 2 3 | {"source_dataset": "sudoku", "source_index": 17, "puzzle": [[0, 5, 0, 8, 0, 0, 0, 0, 6], [8, 1, 9, 0, 6, 4, 2, 3, 0], [0, 2, 0, 0, 7, 3, 5, 8, 0], [4, 8, 0, 6, 0, 9, 7, 1, 5], [1, 0, 2, 0, 5, 7, 0, 6, 4], [0, 0, 6, 0, 8, 0, 3, 0, 0], [7, 0, 1, 2, 0, 0, 0, 5, 8], [2, 4, 8, 0, 3, 0, 0, 7, 9], [9, 6, 5, 7, 4, 8, 1, 0, 3]]... | sudoku |
Solve this Sudoku puzzle:
_ _ 4 _ _ 9 2 6 5
_ _ 2 1 4 _ _ 7 _
_ 9 5 _ _ 7 1 _ _
_ 1 _ 3 9 4 _ _ 8
_ 4 9 _ _ 8 _ _ _
_ 5 _ _ _ _ _ _ 2
_ 6 _ 4 _ _ _ 8 _
4 _ _ _ _ _ 5 2 6
5 _ 7 6 8 _ _ _ 4
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 1 7 4 8 3 9 2 6 5
6 3 2 1 4 5 8 7 9
8 9 5 2 6 7 1 4 3
2 1 6 3 9 4 7 5 8
7 4 9 5 2 8 6 3 1
3 5 8 7 1 6 4 9 2
9 6 1 4 5 2 3 8 7
4 8 3 9 7 1 5 2 6
5 2 7 6 8 3 9 1 4 | {"source_dataset": "sudoku", "source_index": 18, "puzzle": [[0, 0, 4, 0, 0, 9, 2, 6, 5], [0, 0, 2, 1, 4, 0, 0, 7, 0], [0, 9, 5, 0, 0, 7, 1, 0, 0], [0, 1, 0, 3, 9, 4, 0, 0, 8], [0, 4, 9, 0, 0, 8, 0, 0, 0], [0, 5, 0, 0, 0, 0, 0, 0, 2], [0, 6, 0, 4, 0, 0, 0, 8, 0], [4, 0, 0, 0, 0, 0, 5, 2, 6], [5, 0, 7, 6, 8, 0, 0, 0, 4]]... | sudoku |
Solve this Sudoku puzzle:
4 _ _ _ 2 9 7 3 _
_ _ 2 _ 3 _ _ 6 _
5 3 8 _ 7 4 1 9 _
8 _ 1 7 _ _ 6 5 _
_ 6 _ 5 4 _ _ 2 _
2 _ 7 _ _ 8 9 4 1
1 _ 9 _ _ _ _ 7 _
_ _ _ _ 1 _ _ _ 9
3 _ _ _ _ 7 _ 1 _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | 4 1 6 8 2 9 7 3 5
7 9 2 1 3 5 4 6 8
5 3 8 6 7 4 1 9 2
8 4 1 7 9 2 6 5 3
9 6 3 5 4 1 8 2 7
2 5 7 3 6 8 9 4 1
1 8 9 2 5 6 3 7 4
6 7 5 4 1 3 2 8 9
3 2 4 9 8 7 5 1 6 | {"source_dataset": "sudoku", "source_index": 19, "puzzle": [[4, 0, 0, 0, 2, 9, 7, 3, 0], [0, 0, 2, 0, 3, 0, 0, 6, 0], [5, 3, 8, 0, 7, 4, 1, 9, 0], [8, 0, 1, 7, 0, 0, 6, 5, 0], [0, 6, 0, 5, 4, 0, 0, 2, 0], [2, 0, 7, 0, 0, 8, 9, 4, 1], [1, 0, 9, 0, 0, 0, 0, 7, 0], [0, 0, 0, 0, 1, 0, 0, 0, 9], [3, 0, 0, 0, 0, 7, 0, 1, 0]]... | sudoku |
Solve the Tower of Hanoi problem with 3 disks and 3 pegs.
Move all disks from Peg 3 to Peg 2 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 3 to Peg 2
Move disk 2 from Peg 3 to Peg 1
Move disk 1 from Peg 2 to Peg 1
Move disk 3 from Peg 3 to Peg 2
Move disk 1 from Peg 1 to Peg 3
Move disk 2 from Peg 1 to Peg 2
Move disk 1 from Peg 3 to Peg 2 | {"source_dataset": "tower_of_hanoi", "source_index": 0, "num_disks": 3, "num_pegs": 3, "start_peg": 3, "target_peg": 2, "auxiliary_pegs": [1], "solution_length": 7, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 3 disks and 4 pegs.
Move all disks from Peg 2 to Peg 4 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 2 to Peg 1
Move disk 2 from Peg 2 to Peg 3
Move disk 3 from Peg 2 to Peg 4
Move disk 2 from Peg 3 to Peg 4
Move disk 1 from Peg 1 to Peg 4 | {"source_dataset": "tower_of_hanoi", "source_index": 1, "num_disks": 3, "num_pegs": 4, "start_peg": 2, "target_peg": 4, "auxiliary_pegs": [1, 3], "solution_length": 5, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 6 disks and 3 pegs.
Move all disks from Peg 1 to Peg 2 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 1 to Peg 3
Move disk 2 from Peg 1 to Peg 2
Move disk 1 from Peg 3 to Peg 2
Move disk 3 from Peg 1 to Peg 3
Move disk 1 from Peg 2 to Peg 1
Move disk 2 from Peg 2 to Peg 3
Move disk 1 from Peg 1 to Peg 3
Move disk 4 from Peg 1 to Peg 2
Move disk 1 from Peg 3 to Peg 2
Move disk 2 from Peg 3 to Peg 1
... | {"source_dataset": "tower_of_hanoi", "source_index": 2, "num_disks": 6, "num_pegs": 3, "start_peg": 1, "target_peg": 2, "auxiliary_pegs": [3], "solution_length": 63, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 5 disks and 4 pegs.
Move all disks from Peg 4 to Peg 2 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 4 to Peg 3
Move disk 2 from Peg 4 to Peg 1
Move disk 1 from Peg 3 to Peg 1
Move disk 3 from Peg 4 to Peg 2
Move disk 4 from Peg 4 to Peg 3
Move disk 3 from Peg 2 to Peg 3
Move disk 5 from Peg 4 to Peg 2
Move disk 3 from Peg 3 to Peg 4
Move disk 4 from Peg 3 to Peg 2
Move disk 3 from Peg 4 to Peg 2
... | {"source_dataset": "tower_of_hanoi", "source_index": 3, "num_disks": 5, "num_pegs": 4, "start_peg": 4, "target_peg": 2, "auxiliary_pegs": [1, 3], "solution_length": 13, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 3 disks and 4 pegs.
Move all disks from Peg 1 to Peg 3 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 1 to Peg 2
Move disk 2 from Peg 1 to Peg 4
Move disk 3 from Peg 1 to Peg 3
Move disk 2 from Peg 4 to Peg 3
Move disk 1 from Peg 2 to Peg 3 | {"source_dataset": "tower_of_hanoi", "source_index": 4, "num_disks": 3, "num_pegs": 4, "start_peg": 1, "target_peg": 3, "auxiliary_pegs": [2, 4], "solution_length": 5, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 5 disks and 3 pegs.
Move all disks from Peg 2 to Peg 3 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 2 to Peg 3
Move disk 2 from Peg 2 to Peg 1
Move disk 1 from Peg 3 to Peg 1
Move disk 3 from Peg 2 to Peg 3
Move disk 1 from Peg 1 to Peg 2
Move disk 2 from Peg 1 to Peg 3
Move disk 1 from Peg 2 to Peg 3
Move disk 4 from Peg 2 to Peg 1
Move disk 1 from Peg 3 to Peg 1
Move disk 2 from Peg 3 to Peg 2
... | {"source_dataset": "tower_of_hanoi", "source_index": 5, "num_disks": 5, "num_pegs": 3, "start_peg": 2, "target_peg": 3, "auxiliary_pegs": [1], "solution_length": 31, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 7 disks and 4 pegs.
Move all disks from Peg 2 to Peg 3 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 2 to Peg 4
Move disk 2 from Peg 2 to Peg 3
Move disk 3 from Peg 2 to Peg 1
Move disk 2 from Peg 3 to Peg 1
Move disk 1 from Peg 4 to Peg 1
Move disk 4 from Peg 2 to Peg 4
Move disk 5 from Peg 2 to Peg 3
Move disk 4 from Peg 4 to Peg 3
Move disk 6 from Peg 2 to Peg 4
Move disk 4 from Peg 3 to Peg 2
... | {"source_dataset": "tower_of_hanoi", "source_index": 6, "num_disks": 7, "num_pegs": 4, "start_peg": 2, "target_peg": 3, "auxiliary_pegs": [1, 4], "solution_length": 25, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 3 disks and 4 pegs.
Move all disks from Peg 4 to Peg 1 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 4 to Peg 2
Move disk 2 from Peg 4 to Peg 3
Move disk 3 from Peg 4 to Peg 1
Move disk 2 from Peg 3 to Peg 1
Move disk 1 from Peg 2 to Peg 1 | {"source_dataset": "tower_of_hanoi", "source_index": 7, "num_disks": 3, "num_pegs": 4, "start_peg": 4, "target_peg": 1, "auxiliary_pegs": [2, 3], "solution_length": 5, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 6 disks and 4 pegs.
Move all disks from Peg 3 to Peg 4 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 3 to Peg 2
Move disk 2 from Peg 3 to Peg 4
Move disk 3 from Peg 3 to Peg 1
Move disk 2 from Peg 4 to Peg 1
Move disk 1 from Peg 2 to Peg 1
Move disk 4 from Peg 3 to Peg 4
Move disk 5 from Peg 3 to Peg 2
Move disk 4 from Peg 4 to Peg 2
Move disk 6 from Peg 3 to Peg 4
Move disk 4 from Peg 2 to Peg 3
... | {"source_dataset": "tower_of_hanoi", "source_index": 8, "num_disks": 6, "num_pegs": 4, "start_peg": 3, "target_peg": 4, "auxiliary_pegs": [1, 2], "solution_length": 17, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 4 disks and 3 pegs.
Move all disks from Peg 1 to Peg 3 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 1 to Peg 2
Move disk 2 from Peg 1 to Peg 3
Move disk 1 from Peg 2 to Peg 3
Move disk 3 from Peg 1 to Peg 2
Move disk 1 from Peg 3 to Peg 1
Move disk 2 from Peg 3 to Peg 2
Move disk 1 from Peg 1 to Peg 2
Move disk 4 from Peg 1 to Peg 3
Move disk 1 from Peg 2 to Peg 3
Move disk 2 from Peg 2 to Peg 1
... | {"source_dataset": "tower_of_hanoi", "source_index": 9, "num_disks": 4, "num_pegs": 3, "start_peg": 1, "target_peg": 3, "auxiliary_pegs": [2], "solution_length": 15, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 5 disks and 3 pegs.
Move all disks from Peg 3 to Peg 2 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 3 to Peg 2
Move disk 2 from Peg 3 to Peg 1
Move disk 1 from Peg 2 to Peg 1
Move disk 3 from Peg 3 to Peg 2
Move disk 1 from Peg 1 to Peg 3
Move disk 2 from Peg 1 to Peg 2
Move disk 1 from Peg 3 to Peg 2
Move disk 4 from Peg 3 to Peg 1
Move disk 1 from Peg 2 to Peg 1
Move disk 2 from Peg 2 to Peg 3
... | {"source_dataset": "tower_of_hanoi", "source_index": 10, "num_disks": 5, "num_pegs": 3, "start_peg": 3, "target_peg": 2, "auxiliary_pegs": [1], "solution_length": 31, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 7 disks and 3 pegs.
Move all disks from Peg 2 to Peg 3 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 2 to Peg 3
Move disk 2 from Peg 2 to Peg 1
Move disk 1 from Peg 3 to Peg 1
Move disk 3 from Peg 2 to Peg 3
Move disk 1 from Peg 1 to Peg 2
Move disk 2 from Peg 1 to Peg 3
Move disk 1 from Peg 2 to Peg 3
Move disk 4 from Peg 2 to Peg 1
Move disk 1 from Peg 3 to Peg 1
Move disk 2 from Peg 3 to Peg 2
... | {"source_dataset": "tower_of_hanoi", "source_index": 11, "num_disks": 7, "num_pegs": 3, "start_peg": 2, "target_peg": 3, "auxiliary_pegs": [1], "solution_length": 127, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 4 disks and 4 pegs.
Move all disks from Peg 3 to Peg 2 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 3 to Peg 1
Move disk 2 from Peg 3 to Peg 2
Move disk 3 from Peg 3 to Peg 4
Move disk 2 from Peg 2 to Peg 4
Move disk 4 from Peg 3 to Peg 2
Move disk 2 from Peg 4 to Peg 3
Move disk 3 from Peg 4 to Peg 2
Move disk 2 from Peg 3 to Peg 2
Move disk 1 from Peg 1 to Peg 2 | {"source_dataset": "tower_of_hanoi", "source_index": 12, "num_disks": 4, "num_pegs": 4, "start_peg": 3, "target_peg": 2, "auxiliary_pegs": [1, 4], "solution_length": 9, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 3 disks and 3 pegs.
Move all disks from Peg 1 to Peg 2 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 1 to Peg 2
Move disk 2 from Peg 1 to Peg 3
Move disk 1 from Peg 2 to Peg 3
Move disk 3 from Peg 1 to Peg 2
Move disk 1 from Peg 3 to Peg 1
Move disk 2 from Peg 3 to Peg 2
Move disk 1 from Peg 1 to Peg 2 | {"source_dataset": "tower_of_hanoi", "source_index": 13, "num_disks": 3, "num_pegs": 3, "start_peg": 1, "target_peg": 2, "auxiliary_pegs": [3], "solution_length": 7, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 7 disks and 3 pegs.
Move all disks from Peg 2 to Peg 3 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 2 to Peg 3
Move disk 2 from Peg 2 to Peg 1
Move disk 1 from Peg 3 to Peg 1
Move disk 3 from Peg 2 to Peg 3
Move disk 1 from Peg 1 to Peg 2
Move disk 2 from Peg 1 to Peg 3
Move disk 1 from Peg 2 to Peg 3
Move disk 4 from Peg 2 to Peg 1
Move disk 1 from Peg 3 to Peg 1
Move disk 2 from Peg 3 to Peg 2
... | {"source_dataset": "tower_of_hanoi", "source_index": 14, "num_disks": 7, "num_pegs": 3, "start_peg": 2, "target_peg": 3, "auxiliary_pegs": [1], "solution_length": 127, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 3 disks and 4 pegs.
Move all disks from Peg 1 to Peg 4 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 1 to Peg 2
Move disk 2 from Peg 1 to Peg 3
Move disk 3 from Peg 1 to Peg 4
Move disk 2 from Peg 3 to Peg 4
Move disk 1 from Peg 2 to Peg 4 | {"source_dataset": "tower_of_hanoi", "source_index": 15, "num_disks": 3, "num_pegs": 4, "start_peg": 1, "target_peg": 4, "auxiliary_pegs": [2, 3], "solution_length": 5, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 7 disks and 3 pegs.
Move all disks from Peg 1 to Peg 3 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 1 to Peg 3
Move disk 2 from Peg 1 to Peg 2
Move disk 1 from Peg 3 to Peg 2
Move disk 3 from Peg 1 to Peg 3
Move disk 1 from Peg 2 to Peg 1
Move disk 2 from Peg 2 to Peg 3
Move disk 1 from Peg 1 to Peg 3
Move disk 4 from Peg 1 to Peg 2
Move disk 1 from Peg 3 to Peg 2
Move disk 2 from Peg 3 to Peg 1
... | {"source_dataset": "tower_of_hanoi", "source_index": 16, "num_disks": 7, "num_pegs": 3, "start_peg": 1, "target_peg": 3, "auxiliary_pegs": [2], "solution_length": 127, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 4 disks and 3 pegs.
Move all disks from Peg 3 to Peg 2 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 3 to Peg 1
Move disk 2 from Peg 3 to Peg 2
Move disk 1 from Peg 1 to Peg 2
Move disk 3 from Peg 3 to Peg 1
Move disk 1 from Peg 2 to Peg 3
Move disk 2 from Peg 2 to Peg 1
Move disk 1 from Peg 3 to Peg 1
Move disk 4 from Peg 3 to Peg 2
Move disk 1 from Peg 1 to Peg 2
Move disk 2 from Peg 1 to Peg 3
... | {"source_dataset": "tower_of_hanoi", "source_index": 17, "num_disks": 4, "num_pegs": 3, "start_peg": 3, "target_peg": 2, "auxiliary_pegs": [1], "solution_length": 15, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 5 disks and 4 pegs.
Move all disks from Peg 2 to Peg 4 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 2 to Peg 3
Move disk 2 from Peg 2 to Peg 1
Move disk 1 from Peg 3 to Peg 1
Move disk 3 from Peg 2 to Peg 4
Move disk 4 from Peg 2 to Peg 3
Move disk 3 from Peg 4 to Peg 3
Move disk 5 from Peg 2 to Peg 4
Move disk 3 from Peg 3 to Peg 2
Move disk 4 from Peg 3 to Peg 4
Move disk 3 from Peg 2 to Peg 4
... | {"source_dataset": "tower_of_hanoi", "source_index": 18, "num_disks": 5, "num_pegs": 4, "start_peg": 2, "target_peg": 4, "auxiliary_pegs": [1, 3], "solution_length": 13, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
Solve the Tower of Hanoi problem with 6 disks and 3 pegs.
Move all disks from Peg 3 to Peg 1 following the rules:
- Only one disk can be moved at a time.
- A larger disk cannot be placed on top of a smaller disk.
- All disks must be on a peg at all times.
Provide the sequence of moves.
Formatting guidelines:
- Each i... | Move disk 1 from Peg 3 to Peg 2
Move disk 2 from Peg 3 to Peg 1
Move disk 1 from Peg 2 to Peg 1
Move disk 3 from Peg 3 to Peg 2
Move disk 1 from Peg 1 to Peg 3
Move disk 2 from Peg 1 to Peg 2
Move disk 1 from Peg 3 to Peg 2
Move disk 4 from Peg 3 to Peg 1
Move disk 1 from Peg 2 to Peg 1
Move disk 2 from Peg 2 to Peg 3
... | {"source_dataset": "tower_of_hanoi", "source_index": 19, "num_disks": 6, "num_pegs": 3, "start_peg": 3, "target_peg": 1, "auxiliary_pegs": [2], "solution_length": 63, "difficulty": {"num_disks": [3, 7]}} | tower_of_hanoi |
I have a Go problem for you. Black moves next - can you capture some of the white stones?
```
A B C D E F G H I
9 X . . . X . . . .
8 . . . . . . . . .
7 . O . O . . X . .
6 . . . X . . . . O
5 O . X O X . . . .
4 . X O O . O . . .
3 . . X O X . . . .
2 . . . X . . . . .
1 . O . O . . X . .
```
X - Black
... | E4 | {"source_dataset": "tsumego", "source_index": 0, "board": [["X", ".", ".", ".", "X", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", ".", ".", "."], [".", "O", ".", "O", ".", ".", "X", ".", "."], [".", ".", ".", "X", ".", ".", ".", ".", "O"], ["O", ".", "X", "O", "X", ".", ".", ".", "."], [".", "X", "O", "O", ".", ... | tsumego |
Here's a Go challenge. Playing as Black, how can you capture as many white stones as possible?
```
A B C D E F G H I
9 . . O . . . . . .
8 . X O . . . . . .
7 X . X . . . . . .
6 O O O X . . . . .
5 X O O . . . . . .
4 . X . . . . . . O
3 . X . . . . X . .
2 O . O . . . . . .
1 . . . . O . . . .
```
X - B... | B7 | {"source_dataset": "tsumego", "source_index": 1, "board": [[".", ".", "O", ".", ".", ".", ".", ".", "."], [".", "X", "O", ".", ".", ".", ".", ".", "."], ["X", ".", "X", ".", ".", ".", ".", ".", "."], ["O", "O", "O", "X", ".", ".", ".", ".", "."], ["X", "O", "O", ".", ".", ".", ".", ".", "."], [".", "X", ".", ".", ".", ... | tsumego |
Tsumego time. Black to play and capture some stones.
Find the key move.
```
A B C D E F G H I J K L
12 . . . . . . . . . . . .
11 . . X . . . . . . . . .
10 . . . . . . . . . . . .
9 . . . . . . . . . . . .
8 X . . . . X . . . X . .
7 . X . . . . . . . . . .
6 . O X X . . . . . . . O
5 . X O O X . . . . . . .
... | D4 | {"source_dataset": "tsumego", "source_index": 2, "board": [[".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", "."], [".", ".", "X", ".", ".", ".", ".", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", "."], ["X", ".", ".... | tsumego |
Here's a Go challenge. Playing as Black, how can you capture as many white stones as possible?
```
A B C D E F G H I J K
11 . . . . . O X X . . .
10 . . X . O X O O X . .
9 O . . O . X O . . . .
8 . . . . . . X . . . .
7 . . . . . X . . . . .
6 . X . . . . . . . . .
5 . O . . . . . X . . .
4 X . . . . . . . .... | H9 | {"source_dataset": "tsumego", "source_index": 3, "board": [[".", ".", ".", ".", ".", "O", "X", "X", ".", ".", "."], [".", ".", "X", ".", "O", "X", "O", "O", "X", ".", "."], ["O", ".", ".", "O", ".", "X", "O", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", "X", ".", ".", ".", "."], [".", ".", ".", ".", ".", "X", ".... | tsumego |
Tsumego time. Black to play and capture some stones.
Find the key move.
```
A B C D E F G H I
9 . . . . . . . . .
8 . . . . . . O . .
7 . . . . . . . . O
6 . . . . . . . . X
5 . . . X . . . . .
4 O . X O X . . . X
3 O X O O . . . . .
2 . X X O X X . . .
1 X X . X . O . . .
```
X - Black
O - White
Specify... | E3 | {"source_dataset": "tsumego", "source_index": 4, "board": [[".", ".", ".", ".", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", "O", ".", "."], [".", ".", ".", ".", ".", ".", ".", ".", "O"], [".", ".", ".", ".", ".", ".", ".", ".", "X"], [".", ".", ".", "X", ".", ".", ".", ".", "."], ["O", ".", "X", "O", "X", ... | tsumego |
Here's a Go challenge. Playing as Black, how can you capture as many white stones as possible?
```
A B C D E F G H I J K
11 . . . . . . . . . . .
10 X . . . . . O . . . .
9 . X . . . . . . . . .
8 X O X . . . . . O . .
7 O O . X . . . . . . .
6 X O X . . O . . . X .
5 . X . . . . O . . . X
4 . . . X . . . . X... | C7 | {"source_dataset": "tsumego", "source_index": 5, "board": [[".", ".", ".", ".", ".", ".", ".", ".", ".", ".", "."], ["X", ".", ".", ".", ".", ".", "O", ".", ".", ".", "."], [".", "X", ".", ".", ".", ".", ".", ".", ".", ".", "."], ["X", "O", "X", ".", ".", ".", ".", ".", "O", ".", "."], ["O", "O", ".", "X", ".", ".", ".... | tsumego |
I have a Go problem for you. Black moves next - can you capture some of the white stones?
```
A B C D E F G H I J K L M
13 . . . . . . . . . . . . .
12 . . . . . . X . . . . . .
11 O . . . . . . X . . . . .
10 . . . . . . . . . . . . .
9 . . . . . X . X . . . . .
8 . . O . X O O O X . . . .
7 . . X . . X O X . .... | G9 | {"source_dataset": "tsumego", "source_index": 6, "board": [[".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", "X", ".", ".", ".", ".", ".", "."], ["O", ".", ".", ".", ".", ".", ".", "X", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".",... | tsumego |
Here's a Go challenge. Playing as Black, how can you capture as many white stones as possible?
```
A B C D E F G H I
9 O . . . . . O . O
8 . . . X X . . . .
7 . X X O O X . . .
6 . O X O . . . . .
5 . . X X . X O . .
4 . . . . . . O . O
3 . . . . . O . . .
2 . . . . . . . . .
1 . . . . . . . . .
```
X - B... | E6 | {"source_dataset": "tsumego", "source_index": 7, "board": [["O", ".", ".", ".", ".", ".", "O", ".", "O"], [".", ".", ".", "X", "X", ".", ".", ".", "."], [".", "X", "X", "O", "O", "X", ".", ".", "."], [".", "O", "X", "O", ".", ".", ".", ".", "."], [".", ".", "X", "X", ".", "X", "O", ".", "."], [".", ".", ".", ".", ".", ... | tsumego |
I have a Go problem for you. Black moves next - can you capture some of the white stones?
```
A B C D E F G H I J K L
12 . . . . . . . . . . . .
11 . . . . . O . . . . . O
10 . . . . . O . . . . . .
9 . . . . . . . X . . O X
8 . . . . . O X . X . . .
7 . O . . . X O O O X . O
6 X . . . . . X O X . . .
5 . . . ... | H8 | {"source_dataset": "tsumego", "source_index": 8, "board": [[".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".", "O", ".", ".", ".", ".", ".", "O"], [".", ".", ".", ".", ".", "O", ".", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", ".", "X", ".", ".", "O", "X"], [".", ".", ".... | tsumego |
Here's a Go challenge. Playing as Black, how can you capture as many white stones as possible?
```
A B C D E F G H I J
10 . X . X . . . . . .
9 X O O O X . . . . .
8 . X O X . O . X . .
7 X . X . . . . . X .
6 X . . . . . O . . .
5 . . . . . . . O . .
4 . . . . . . . . O .
3 . . . . . . . . . .
2 . . . . . ... | C10 | {"source_dataset": "tsumego", "source_index": 9, "board": [[".", "X", ".", "X", ".", ".", ".", ".", ".", "."], ["X", "O", "O", "O", "X", ".", ".", ".", ".", "."], [".", "X", "O", "X", ".", "O", ".", "X", ".", "."], ["X", ".", "X", ".", ".", ".", ".", ".", "X", "."], ["X", ".", ".", ".", ".", ".", "O", ".", ".", "."], [... | tsumego |
Tsumego time. Black to play and capture some stones.
Find the key move.
```
A B C D E F G H I J K
11 . . . . . . . . X O .
10 . . . . . . . . . X .
9 . . O . . . . . . . .
8 . X . . . . . . . . .
7 . . . . . . . . . X .
6 . . . . . . X . X O X
5 . . O . . . . X O O .
4 . . . O . . . X X O X
3 . . . . . . X .... | K5 | {"source_dataset": "tsumego", "source_index": 10, "board": [[".", ".", ".", ".", ".", ".", ".", ".", "X", "O", "."], [".", ".", ".", ".", ".", ".", ".", ".", ".", "X", "."], [".", ".", "O", ".", ".", ".", ".", ".", ".", ".", "."], [".", "X", ".", ".", ".", ".", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", "... | tsumego |
Tsumego time. Black to play and capture some stones.
Find the key move.
```
A B C D E F G H I J K L M
13 . . O . . X . . . . . X .
12 . . . . . . . . . . X . X
11 . . . . . . . . . X O O O
10 . . X . . . . O . . X O X
9 . . . . . . . . . . . X .
8 . . . X . . . . O . . X .
7 . . . . . . . . . . . . .
6 . . . . ... | L12 | {"source_dataset": "tsumego", "source_index": 11, "board": [[".", ".", "O", ".", ".", "X", ".", ".", ".", ".", ".", "X", "."], [".", ".", ".", ".", ".", ".", ".", ".", ".", ".", "X", ".", "X"], [".", ".", ".", ".", ".", ".", ".", ".", ".", "X", "O", "O", "O"], [".", ".", "X", ".", ".", ".", ".", "O", ".", ".", "X", "O"... | tsumego |
Here's a Go challenge. Playing as Black, how can you capture as many white stones as possible?
```
A B C D E F G H I J
10 . . . O . . . . . .
9 . . . . O . . . . .
8 . X . . . . . . . .
7 X . X X . . . . . .
6 O O O X . . . . . .
5 X O X . . . . . . O
4 X X . . O . . . . .
3 . . . . . . X . X O
2 . . . . . ... | B7 | {"source_dataset": "tsumego", "source_index": 12, "board": [[".", ".", ".", "O", ".", ".", ".", ".", ".", "."], [".", ".", ".", ".", "O", ".", ".", ".", ".", "."], [".", "X", ".", ".", ".", ".", ".", ".", ".", "."], ["X", ".", "X", "X", ".", ".", ".", ".", ".", "."], ["O", "O", "O", "X", ".", ".", ".", ".", ".", "."], ... | tsumego |
Here's a Go challenge. Playing as Black, how can you capture as many white stones as possible?
```
A B C D E F G H I
9 . . . . X . . X X
8 . . . . . X X O O
7 . . . . . . X O .
6 . O O . . . X X O
5 . O . . . . . . .
4 . . . . . . . . .
3 . . . X . . . . O
2 . . . X . . . . X
1 . . . . . . X . .
```
X - B... | I7 | {"source_dataset": "tsumego", "source_index": 13, "board": [[".", ".", ".", ".", "X", ".", ".", "X", "X"], [".", ".", ".", ".", ".", "X", "X", "O", "O"], [".", ".", ".", ".", ".", ".", "X", "O", "."], [".", "O", "O", ".", ".", ".", "X", "X", "O"], [".", "O", ".", ".", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".",... | tsumego |
Tsumego time. Black to play and capture some stones.
Find the key move.
```
A B C D E F G H I J K L M
13 . . X . . . . O . . . . .
12 . . . . . . . . . . . . .
11 . . . . . . . . . . . X .
10 O . X . . . . . X . . . .
9 . . . . . . . . . . . . O
8 . . . . . . . . . X . . .
7 . . . . . . . . . . . X .
6 . . . . ... | D2 | {"source_dataset": "tsumego", "source_index": 14, "board": [[".", ".", "X", ".", ".", ".", ".", "O", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", "X", "."], ["O", ".", "X", ".", ".", ".", ".", ".", "X", ".", ".", "."... | tsumego |
I have a Go problem for you. Black moves next - can you capture some of the white stones?
```
A B C D E F G H I
9 . . . . . . . . .
8 . . . . . . . O .
7 . . X . . . . . O
6 . . . . . . . . .
5 . . . . . . . . .
4 X X X X . . X X .
3 . X O O X O X . O
2 . X O . . . . . .
1 . . O X . . . . .
```
X - Black
... | D2 | {"source_dataset": "tsumego", "source_index": 15, "board": [[".", ".", ".", ".", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", ".", "O", "."], [".", ".", "X", ".", ".", ".", ".", ".", "O"], [".", ".", ".", ".", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", ".", ".", "."], ["X", "X", "X", "X", ".",... | tsumego |
Tsumego time. Black to play and capture some stones.
Find the key move.
```
A B C D E F G H I J K L M
13 . . . . . . . . . . . . .
12 . . . . . . . . . . . . .
11 . . . . . . . . . . . . .
10 X . . O . . . O . . . . .
9 X . . . . . . . . . . . .
8 . . . . . . . . . . . . .
7 . . . . . O . . . . . . .
6 . . . . ... | K4 | {"source_dataset": "tsumego", "source_index": 16, "board": [[".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", "."], ["X", ".", ".", "O", ".", ".", ".", "O", ".", ".", ".", "."... | tsumego |
Tsumego time. Black to play and capture some stones.
Find the key move.
```
A B C D E F G H I J
10 . . . . . . . X . .
9 . . . . X O . X . .
8 . . . . . . . . O .
7 . O . . . . . . . .
6 O . . X . . . . . .
5 . . X . X . . . . .
4 . X O O O X . . . .
3 . . X O X . . . . .
2 . . . X O . . . . .
1 . . . . . ... | D5 | {"source_dataset": "tsumego", "source_index": 17, "board": [[".", ".", ".", ".", ".", ".", ".", "X", ".", "."], [".", ".", ".", ".", "X", "O", ".", "X", ".", "."], [".", ".", ".", ".", ".", ".", ".", ".", "O", "."], [".", "O", ".", ".", ".", ".", ".", ".", ".", "."], ["O", ".", ".", "X", ".", ".", ".", ".", ".", "."], ... | tsumego |
Here's a Go challenge. Playing as Black, how can you capture as many white stones as possible?
```
A B C D E F G H I J K
11 . . . . . . . . . O .
10 . . . . . . . . . . O
9 . . X . . X X . . . .
8 . . . . X O X X . . .
7 . . X X O O . . . X .
6 O . . . X O X . . . .
5 . . . . . X . . . . .
4 . . . . . . . . .... | G7 | {"source_dataset": "tsumego", "source_index": 18, "board": [[".", ".", ".", ".", ".", ".", ".", ".", ".", "O", "."], [".", ".", ".", ".", ".", ".", ".", ".", ".", ".", "O"], [".", ".", "X", ".", ".", "X", "X", ".", ".", ".", "."], [".", ".", ".", ".", "X", "O", "X", "X", ".", ".", "."], [".", ".", "X", "X", "O", "O", "... | tsumego |
Tsumego time. Black to play and capture some stones.
Find the key move.
```
A B C D E F G H I J K L
12 . . . . . . . . O . . .
11 . . . . . . . . . . . .
10 . . . . . . . . X X X X
9 . . . . . . . . . X O O
8 . . . . . . . . . X O .
7 . X X . X . . . . X X .
6 . . X . O . . . . . . .
5 . . . . . . . . . . . .
... | L8 | {"source_dataset": "tsumego", "source_index": 19, "board": [[".", ".", ".", ".", ".", ".", ".", ".", "O", ".", ".", "."], [".", ".", ".", ".", ".", ".", ".", ".", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", ".", ".", "X", "X", "X", "X"], [".", ".", ".", ".", ".", ".", ".", ".", ".", "X", "O", "O"], [".", ".", "... | tsumego |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.