spock-oss/sel-qwen-4b
Feature Extraction • Updated
Datasets:
id stringlengths 11 11 | task_id int32 101 309 | task stringclasses 22
values | split stringclasses 1
value | original_index int32 0 31.2k | group_id stringlengths 29 64 | input_tokens int32 80 2.05k | source_units int32 35 1.96k | modality stringclasses 2
values | selection_mode stringclasses 3
values | source_url stringclasses 9
values | source_record_id stringlengths 2 101 ⌀ | source_revision stringclasses 2
values | original_record_sha256 stringlengths 64 64 | source_text stringlengths 61 8.85k ⌀ | image imagewidth (px) 288 1.1k ⌀ | queries listlengths 1 9 | query_first bool 2
classes | environment_prompt stringclasses 17
values | record_json stringlengths 369 16.2k | source_image_sha256 stringlengths 64 64 ⌀ | upstream_terms stringclasses 5
values | attribution stringclasses 425
values | attribution_url stringclasses 804
values |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
train-00000 | 101 | Reasoning Gym N-Queens | train | 0 | d2bcf068f532a905420a7a36a7ecabd42f4bc207cbd32502dd8cdc09caed23b8 | 243 | 168 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000363/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 6318ee3bddd7469e25539ff3d1d4c7c82e858cbc6160bbff74a33959b64b2c99 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":534,"end":535},{"kind":"span","start":542,"end":543},{"kind":"span","start":550,"end":551},{"kind":"span","start":580,"end"... | null | Apache-2.0 | null | null |
train-00001 | 101 | Reasoning Gym N-Queens | train | 1 | 782c9134309c3aa901b15d2af8579b2adda608a2a4f43a54f09f4fc21bce6d8d | 172 | 88 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000364/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 4905db088665025cdd9ec4aec0cee1f1872336687a4bf0614e88ce9fbeb2235c | Navigate from 'l' (start) to 'x' (goal):
```
uuuuuu
ubuuuu
ubxubu
ubbuuu
uluuuu
uuuuuu
```
Legend: 'u' = Wall, 'b' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":61,"end":62},{"kind":"span","start":62,"end":63},{"kind":"span","start":68,"end":69},{"kind... | null | Apache-2.0 | null | null |
train-00002 | 101 | Reasoning Gym N-Queens | train | 2 | fa5e6fc445ecab893efee32a61f23ace5dbb97852bc040a6bd39bfb9ba993d55 | 376 | 181 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/sudoku.py | sudoku/seed=101000365/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 90f56b09d0efe6a094f0c85e35e942627d039e39fc34e37f579836f603fa6e3d | Solve this Sudoku puzzle:
6 1 _ _ _ _ 3 4 7
9 7 2 1 3 4 5 8 _
3 _ 4 _ 7 _ _ 2 9
_ 2 7 9 5 3 4 6 8
8 5 6 4 _ _ 9 3 2
4 _ 3 6 _ 2 7 1 5
7 4 8 2 _ 1 6 5 _
5 3 1 7 6 8 2 9 _
_ 6 9 3 4 5 _ 7 _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | Not supported with pagination yet | [
"Select blank cells whose solved value is 1.",
"Select blank cells whose solved value is 2.",
"Select blank cells whose solved value is 3.",
"Select blank cells whose solved value is 4.",
"Select blank cells whose solved value is 5.",
"Select blank cells whose solved value is 6.",
"Select blank cells wh... | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select blank cells whose solved value is 1."},{"id":"q2","text":"Select blank cells whose solved value is 2."},{"id":"q3","text":"Select blank cells whose solved value is 3."},{"id":"q4","text":"Select blank cells whose solved value is 4.... | null | Apache-2.0 | null | null |
train-00003 | 101 | Reasoning Gym N-Queens | train | 3 | 2a6220c6f990607ed52e6c68718217ea00ff2dcf4691e0b33bba39a7c709506b | 257 | 182 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000366/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 43ef2a3512c531c47852b89855e1bebdcffdd14fc13d2dd303def260c4790f20 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":536,"end":537},{"kind":"span","start":542,"end":543},{"kind":"span","start":562,"end":563},{"kind":"span","start":568,"end"... | null | Apache-2.0 | null | null |
train-00004 | 101 | Reasoning Gym N-Queens | train | 4 | 52ba91bf8e39d3ae56404614b21868f48a8fd065b9deecb6273f856dd719bf23 | 187 | 103 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000367/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 63508033719e849e5d90a8b626aa9b564124f883efe8dc1c34a961444c2fd22e | Navigate from '.' (start) to '%' (goal):
```
(((((((((
(<<((<<<(
((<(((<.(
(<((((<<(
(((((<<((
(<(%(<(<(
(<(<<<<((
(((((<(<(
(((((((((
```
Legend: '(' = Wall, '<' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":72,"end":73},{"kind":"span","start":73,"end":74},{"kind":"span","start":82,"end":83},{"kind... | null | Apache-2.0 | null | null |
train-00005 | 101 | Reasoning Gym N-Queens | train | 5 | 36ad4e31864995047474cf151cadee6ce5ffef8178f2d7b76771b1fb0906aa69 | 273 | 198 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000369/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | b64ad1e9352ce3d8b3ae7157d39647f2c05437b7e0573a84afcb20d1fbb03834 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":526,"end":527},{"kind":"span","start":578,"end":579},{"kind":"span","start":612,"end":613},{"kind":"span","start":624,"end"... | null | Apache-2.0 | null | null |
train-00006 | 101 | Reasoning Gym N-Queens | train | 6 | eecc6fc148e0eebb587e94fa9825a1699a9e8ca5497bee4d1725493485691fa5 | 291 | 216 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000372/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 69f34b862123b7dacff85eccfc1681c3210e11c63ed028e0eccbb923f48b7594 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":604,"end":605},{"kind":"span","start":628,"end":629},{"kind":"span","start":642,"end":643}]}],"verification":{"status":"ver... | null | Apache-2.0 | null | null |
train-00007 | 101 | Reasoning Gym N-Queens | train | 7 | 4e42cb76ac823e1d31440ef779f18b08dfe7e74bf2ac8f052792b3d54918d952 | 215 | 131 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000373/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 8c5b0278dbd2a8b312a2b01014aa422531675da9370e5821f6deb6034df214dc | Navigate from 'q' (start) to '!' (goal):
```
99999999
9p9pp999
99999999
9!pppq99
999p9p99
9p999p99
9999ppp9
99999999
```
Legend: '9' = Wall, 'p' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":74,"end":75},{"kind":"span","start":75,"end":76},{"kind":"span","start":76,"end":77},{"kind... | null | Apache-2.0 | null | null |
train-00008 | 101 | Reasoning Gym N-Queens | train | 8 | 3e0c24249de61031814d997e3f625305192f49af719f861ffe38703e8ac53772 | 351 | 156 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/sudoku.py | sudoku/seed=101000374/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 2ec25b33f2e3248463911028b8572002da9e5f50b9f13c404a50f481b1a7e105 | Solve this Sudoku puzzle:
6 _ 5 _ _ _ _ _ 4
_ 1 _ _ _ 4 6 _ 8
8 3 4 6 7 2 _ _ _
_ _ 9 _ 1 7 _ _ 3
3 _ _ _ _ _ _ _ _
_ _ _ _ 6 8 _ _ _
_ 2 _ _ 4 6 1 _ _
_ 4 6 7 _ 3 _ 5 9
7 _ _ _ 2 _ _ 3 _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | Not supported with pagination yet | [
"Select blank cells whose solved value is 1.",
"Select blank cells whose solved value is 2.",
"Select blank cells whose solved value is 3.",
"Select blank cells whose solved value is 4.",
"Select blank cells whose solved value is 5.",
"Select blank cells whose solved value is 6.",
"Select blank cells wh... | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select blank cells whose solved value is 1."},{"id":"q2","text":"Select blank cells whose solved value is 2."},{"id":"q3","text":"Select blank cells whose solved value is 3."},{"id":"q4","text":"Select blank cells whose solved value is 4.... | null | Apache-2.0 | null | null |
train-00009 | 101 | Reasoning Gym N-Queens | train | 9 | 0d32c2ddd9f58aab66911816a9a5eed24ab30b1fb8e48fd272f0de0578a69c73 | 243 | 168 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000376/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | bf6a67de5ad5d30572a143399a1cb5d306b82561ec022c81a7026592a047b4ca | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":534,"end":535},{"kind":"span","start":542,"end":543},{"kind":"span","start":550,"end":551},{"kind":"span","start":572,"end"... | null | Apache-2.0 | null | null |
train-00010 | 101 | Reasoning Gym N-Queens | train | 10 | cf82fe5785d925ba17efbfe9050cb69ce720337a2724841a9ac10d20bf3d1bc3 | 191 | 107 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000377/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 95347bba98277c802d0e1720017cd415f2ad0d4ddd9898c8b4f24c21e0aae227 | Navigate from 'Y' (start) to 'G' (goal):
```
PPPPPPPP
PPPPaPPP
PaYPPaaP
PaPaPPPP
PaaaaPaP
PaaPaGPP
PaaPaaPP
PPPPPPPP
```
Legend: 'P' = Wall, 'a' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":65,"end":66},{"kind":"span","start":66,"end":67},{"kind":"span","start":74,"end":75},{"kind... | null | Apache-2.0 | null | null |
train-00011 | 101 | Reasoning Gym N-Queens | train | 11 | 4769838a027437c516bc20d10dd8a23300b2535abaf2312da6481ed1219d1dcd | 375 | 180 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/sudoku.py | sudoku/seed=101000378/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 00c0b59119fdb46e166a21f9c69196b06adce495a4af966cf3028559720751cc | Solve this Sudoku puzzle:
6 5 8 1 9 2 _ 7 _
_ 9 2 _ 4 7 1 6 5
7 1 4 _ _ 5 8 _ 2
8 4 9 _ 5 1 7 3 6
2 3 _ _ 7 _ _ _ 1
1 7 5 6 _ 3 _ _ 9
5 8 1 7 3 6 9 2 4
9 6 _ 5 _ 4 3 1 8
4 2 3 9 _ 8 6 5 _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | Not supported with pagination yet | [
"Select blank cells whose solved value is 1.",
"Select blank cells whose solved value is 2.",
"Select blank cells whose solved value is 3.",
"Select blank cells whose solved value is 4.",
"Select blank cells whose solved value is 5.",
"Select blank cells whose solved value is 6.",
"Select blank cells wh... | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select blank cells whose solved value is 1."},{"id":"q2","text":"Select blank cells whose solved value is 2."},{"id":"q3","text":"Select blank cells whose solved value is 3."},{"id":"q4","text":"Select blank cells whose solved value is 4.... | null | Apache-2.0 | null | null |
train-00012 | 101 | Reasoning Gym N-Queens | train | 12 | 0c7bdc2f56a49340196ee1b901f91e5da93a52679e7457cba11d2a36c8caa055 | 256 | 172 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000380/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 29d80092f2d45b4f862231e331ef41b59604e701550b625f4107dca3879e25be | Navigate from '!' (start) to 'b' (goal):
```
ppppppppppp
p6ppp666ppp
pp6p666pb6p
p!p66p6666p
p6pp66ppp6p
p666666p66p
pp6pp66p6pp
p6p666ppppp
pp6666p6ppp
p66p666p66p
ppppppppppp
```
Legend: 'p' = Wall, '6' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answ... | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":74,"end":75},{"kind":"span","start":75,"end":76},{"kind":"span","start":76,"end":77},{"kind... | null | Apache-2.0 | null | null |
train-00013 | 101 | Reasoning Gym N-Queens | train | 13 | a3ad987299cbbc69f2b0c6601ef3e5c4c7cd3eec595971a2f6bcebf3aae6ad0c | 273 | 198 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000382/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 4dbdb686df80f6c82987cabcd5349056c4879299cde4e0324232e3334af07252 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":530,"end":531},{"kind":"span","start":542,"end":543},{"kind":"span","start":570,"end":571},{"kind":"span","start":604,"end"... | null | Apache-2.0 | null | null |
train-00014 | 101 | Reasoning Gym N-Queens | train | 14 | e44be3d7a8b9acb06bf9976f23c79169ff721e752dcbb13e4f3fb5b11b090d5b | 174 | 90 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000383/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 2b47549b2157d2d7ad275cdb90b12f38c29419653f0e46b46687e837194dd432 | Navigate from '!' (start) to '>' (goal):
```
IIIIIII
I###III
III##II
II####I
I#>#III
I###!#I
IIIIIII
```
Legend: 'I' = Wall, '#' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":80,"end":81},{"kind":"span","start":81,"end":82},{"kind":"span","start":88,"end":89},{"kind... | null | Apache-2.0 | null | null |
train-00015 | 101 | Reasoning Gym N-Queens | train | 15 | 984438becce7a008195974a7f1c72f5ae8fc2ab74d5e6cd961ac4852fe4c58f1 | 360 | 165 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/sudoku.py | sudoku/seed=101000384/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 505a2037dbeb3c529cbdfe9901622da237e62b4a43db5d141901b43379a28503 | Solve this Sudoku puzzle:
_ _ 7 9 1 _ _ _ _
_ _ _ _ _ 7 _ _ 9
3 1 9 4 _ _ 6 7 _
_ 9 _ _ 8 2 4 _ 7
7 6 _ _ 4 9 8 5 3
_ 3 _ 7 _ _ 9 1 _
_ 2 3 _ 7 1 5 9 _
_ 4 6 _ _ 8 7 _ _
5 _ _ 2 9 _ _ 8 _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | Not supported with pagination yet | [
"Select blank cells whose solved value is 1.",
"Select blank cells whose solved value is 2.",
"Select blank cells whose solved value is 3.",
"Select blank cells whose solved value is 4.",
"Select blank cells whose solved value is 5.",
"Select blank cells whose solved value is 6.",
"Select blank cells wh... | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select blank cells whose solved value is 1."},{"id":"q2","text":"Select blank cells whose solved value is 2."},{"id":"q3","text":"Select blank cells whose solved value is 3."},{"id":"q4","text":"Select blank cells whose solved value is 4.... | null | Apache-2.0 | null | null |
train-00016 | 101 | Reasoning Gym N-Queens | train | 16 | 8acbe8ee3b0cff822d7bf7a6252a2549e047e88a6cb93a1d32a6631c42406be8 | 291 | 216 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000385/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 95064782409036cc17aa2d287a55c45b5c1aa8fc96fcdfc551180b3540675eba | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":550,"end":551},{"kind":"span","start":596,"end":597},{"kind":"span","start":608,"end":609},{"kind":"span","start":620,"end"... | null | Apache-2.0 | null | null |
train-00017 | 101 | Reasoning Gym N-Queens | train | 17 | cfc7a08a5f6eee025219b8c02894b5a9d29fb58c3e3e3500285fada9ac44f2e5 | 220 | 136 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000386/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 0456d88ea6da7385730445cc3d9a6c3d8fab0a1886ebff8314f1527758888463 | Navigate from 'E' (start) to 'j' (goal):
```
CCCCCCCCCCC
CKKKCKKKKKC
CCKKKKKCKCC
CKCKCCKKKKC
CKCKKKCKKKC
CKKKKKKCKCC
CCKKKCKKKKC
CKKjCKKCCEC
CKKCKKKCKKC
CCCKKKKKKKC
CCCCCCCCCCC
```
Legend: 'C' = Wall, 'K' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answ... | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":109,"end":110},{"kind":"span","start":110,"end":111},{"kind":"span","start":111,"end":112},... | null | Apache-2.0 | null | null |
train-00018 | 101 | Reasoning Gym N-Queens | train | 18 | ea2077e5a3b44f9ad1ca926d41751ba8f178db261b7ab8184aaae9520afeb2db | 352 | 157 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/sudoku.py | sudoku/seed=101000387/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | cce6da2747f0fcca7b454cab1cb3c9eaaa25adc106220727bcfac91ac50ccb11 | Solve this Sudoku puzzle:
_ _ _ _ _ 4 6 _ 7
5 9 _ _ 2 7 _ 4 _
4 _ 7 3 _ _ 1 _ 2
3 6 _ _ _ 5 _ 8 1
_ _ 4 6 _ 3 9 _ _
_ _ _ _ _ _ _ _ _
_ _ 8 7 _ 2 _ 3 9
_ _ 3 4 _ 1 _ _ _
_ _ 2 _ _ _ 4 _ 6
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | Not supported with pagination yet | [
"Select blank cells whose solved value is 1.",
"Select blank cells whose solved value is 2.",
"Select blank cells whose solved value is 3.",
"Select blank cells whose solved value is 4.",
"Select blank cells whose solved value is 5.",
"Select blank cells whose solved value is 6.",
"Select blank cells wh... | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select blank cells whose solved value is 1."},{"id":"q2","text":"Select blank cells whose solved value is 2."},{"id":"q3","text":"Select blank cells whose solved value is 3."},{"id":"q4","text":"Select blank cells whose solved value is 4.... | null | Apache-2.0 | null | null |
train-00019 | 101 | Reasoning Gym N-Queens | train | 19 | 62ba2c540d9336480cdd8adc7febbde58d775e80e67701da988133bc5d5f1060 | 236 | 152 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000390/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 4c04845cf6cfd26149898466219923879ae40f2de391ba708e9866df3b659122 | Navigate from 'E' (start) to ':' (goal):
```
aaaaaaaaaaaaaa
a....a...a..aa
a......aaa.a.a
a......a.a...a
a.a..a.a:.a..a
a..aa...a....a
a..a.....a..aa
a........a.a.a
aa...........a
a..aa....a.a.a
a...aa.......a
aE.......a..aa
aa..a.......aa
aaaaaaaaaaaaaa
```
Legend: 'a' = Wall, '.' = Passage
What is the minimum numbe... | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":114,"end":115},{"kind":"span","start":115,"end":116},{"kind":"span","start":130,"end":131},... | null | Apache-2.0 | null | null |
train-00020 | 101 | Reasoning Gym N-Queens | train | 20 | 1a39e397ff0d98b3f34b22b51843692a7ae82226b079b3f9cfc3b9f74dd5d5f8 | 257 | 182 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000392/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | ef36a8a60f27e1ff92d07926a2e12fbd484a0d92934155b5b6bcba42a5fba8cf | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":532,"end":533},{"kind":"span","start":540,"end":541},{"kind":"span","start":584,"end":585},{"kind":"span","start":608,"end"... | null | Apache-2.0 | null | null |
train-00021 | 101 | Reasoning Gym N-Queens | train | 21 | aee01b0a49e7ba8bd91856a1f812d4aa7d1b9574cf6ed273430e620efbab7e73 | 182 | 98 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000393/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 0d01e1f1d97a3a702e6200aab590fce7ab8df3295728cc5d8f2fb194c7a28227 | Navigate from 'z' (start) to 'D' (goal):
```
%%%%%%%
%O%O%%%
%%O%OD%
%%OOO%%
%%%zOO%
%O%O%O%
%%%%%%%
```
Legend: '%' = Wall, 'O' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":66,"end":67},{"kind":"span","start":67,"end":68},{"kind":"span","start":73,"end":74},{"kind... | null | Apache-2.0 | null | null |
train-00022 | 101 | Reasoning Gym N-Queens | train | 22 | 53184c0bb6494e7721068aab6315aaa4ae1ffd04e6015374bc22ef41143c68f7 | 273 | 198 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000395/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | d9440ce60e5c6fb57d49364ff2fa169ee0eb4fd5597cb7f02fbb7a47ac0d94b0 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":534,"end":535},{"kind":"span","start":556,"end":557},{"kind":"span","start":564,"end":565},{"kind":"span","start":608,"end"... | null | Apache-2.0 | null | null |
train-00023 | 101 | Reasoning Gym N-Queens | train | 23 | f4bd780e6bbd9af6593e223e20bf70780a0757e08d05ce3dfcde6d74e83c1047 | 213 | 129 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000396/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 63bd173f3e4a3e4a6ac2ac64457180ded9de68e8467dd0df2ffb9fd838cb539a | Navigate from 'U' (start) to '#' (goal):
```
ooooooooooo
o+++oooo+oo
ooo+++oo+oo
oo++oU+oooo
o+oooo+oo+o
o+oo+o+o+oo
o+oooo++ooo
o+ooo+++o#o
ooo++o++++o
ooooo+ooooo
ooooooooooo
```
Legend: 'o' = Wall, '+' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answ... | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":87,"end":88},{"kind":"span","start":88,"end":89},{"kind":"span","start":100,"end":101},{"ki... | null | Apache-2.0 | null | null |
train-00024 | 101 | Reasoning Gym N-Queens | train | 24 | b5a003547c9b0992b235ac05328ecc4414c698359a59e7ee517dedae492e19ce | 360 | 165 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/sudoku.py | sudoku/seed=101000397/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 35276dfec33ebd5136066f3f2eeadf2e594a1801574e6be17e9647264aa437a3 | Solve this Sudoku puzzle:
_ _ _ 4 _ _ 5 _ 7
_ _ _ 9 _ _ 2 _ 4
_ 6 5 _ _ 1 _ 9 3
_ _ 2 _ _ _ _ 3 1
8 7 1 _ 9 6 4 2 5
3 _ 6 _ _ _ 7 _ 9
6 _ 3 7 _ _ _ 5 2
_ _ _ _ 3 2 9 7 8
_ 9 7 _ 1 _ _ 4 6
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | Not supported with pagination yet | [
"Select blank cells whose solved value is 1.",
"Select blank cells whose solved value is 2.",
"Select blank cells whose solved value is 3.",
"Select blank cells whose solved value is 4.",
"Select blank cells whose solved value is 5.",
"Select blank cells whose solved value is 6.",
"Select blank cells wh... | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select blank cells whose solved value is 1."},{"id":"q2","text":"Select blank cells whose solved value is 2."},{"id":"q3","text":"Select blank cells whose solved value is 3."},{"id":"q4","text":"Select blank cells whose solved value is 4.... | null | Apache-2.0 | null | null |
train-00025 | 101 | Reasoning Gym N-Queens | train | 25 | d5895f295668447c41a53ce2141f8e122eda6a7aafaa3a10558a6cdfa1b5a4a4 | 291 | 216 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000398/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | c33fa7b64f66886711f7ff077b8572b8aa13a78a81322d1342ce008774df0ab2 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":526,"end":527},{"kind":"span","start":558,"end":559},{"kind":"span","start":570,"end":571},{"kind":"span","start":584,"end"... | null | Apache-2.0 | null | null |
train-00026 | 101 | Reasoning Gym N-Queens | train | 26 | c7b67df4b8913ceeaf37e9d8d250ec4e5c705f34cba5f3c62123f55bc51704e8 | 247 | 163 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000399/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 7e7ec2a42ad593eec3880382691dcb696c78c243f45304eba4543c8b1e6d5c2a | Navigate from '/' (start) to 'q' (goal):
```
YYYYYYYYYYYY
YYVYYYYVYYVY
YVYYYVYVYYVY
YYVVYYYVYYVY
YVVVYVYVVYVY
YVYVVVYVYVYY
YqYYVVVVYYVY
YVYVVYYVVVYY
YYVYYYYVVYVY
YVVVYYVY/YYY
YVYVYVYYYYVY
YYYYYYYYYYYY
```
Legend: 'Y' = Wall, 'V' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of ... | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":99,"end":100},{"kind":"span","start":100,"end":101},{"kind":"span","start":101,"end":102},{... | null | Apache-2.0 | null | null |
train-00027 | 101 | Reasoning Gym N-Queens | train | 27 | 4ad61ad764b538c2c4149169b19e9655e8d4742c4f66d31359fc5deec2694bb3 | 350 | 155 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/sudoku.py | sudoku/seed=101000400/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | e3a8f132ccba70189d27cf352c788772613136a9cb94c9eb0bd28052327c4b03 | Solve this Sudoku puzzle:
_ _ _ 8 _ 3 _ 6 _
2 _ _ _ _ 6 _ _ 1
4 7 _ 9 1 _ _ 3 _
3 _ _ 1 _ 4 6 _ _
_ _ _ _ 6 _ 3 _ _
1 6 5 3 _ _ 7 2 4
9 _ 8 _ _ _ _ 5 _
_ _ _ _ 9 _ _ 7 3
_ 5 _ _ _ _ _ 4 6
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | Not supported with pagination yet | [
"Select blank cells whose solved value is 1.",
"Select blank cells whose solved value is 2.",
"Select blank cells whose solved value is 3.",
"Select blank cells whose solved value is 4.",
"Select blank cells whose solved value is 5.",
"Select blank cells whose solved value is 6.",
"Select blank cells wh... | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select blank cells whose solved value is 1."},{"id":"q2","text":"Select blank cells whose solved value is 2."},{"id":"q3","text":"Select blank cells whose solved value is 3."},{"id":"q4","text":"Select blank cells whose solved value is 4.... | null | Apache-2.0 | null | null |
train-00028 | 101 | Reasoning Gym N-Queens | train | 28 | 4a870459a4141d26e64e087ac01889f3051c588d99b146694c0a77c7e0e594a1 | 243 | 168 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000401/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | e034355a6b5897d07c5e18d0a3c885d6e78a1e8b352adec28bfd3c51777f8442 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":552,"end":553},{"kind":"span","start":570,"end":571},{"kind":"span","start":574,"end":575}]}],"verification":{"status":"ver... | null | Apache-2.0 | null | null |
train-00029 | 101 | Reasoning Gym N-Queens | train | 29 | 98b0c1b04fdad2ec8851cd0be70d9a836156135eb6722d0ae93bafffa55808e2 | 175 | 91 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000402/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 42006dd798c9081cb4f83e8bb3d3ac0b98eecfc9c48e2f8ca026a1e9b17b96b7 | Navigate from 'N' (start) to 'v' (goal):
```
^^^^^^
^h^hh^
^h^v^^
^^hhh^
^hN^^^
^^^^^^
```
Legend: '^' = Wall, 'h' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":63,"end":64},{"kind":"span","start":69,"end":70},{"kind":"span","start":70,"end":71},{"kind... | null | Apache-2.0 | null | null |
train-00030 | 101 | Reasoning Gym N-Queens | train | 30 | b3658d418bdb1708f1007572b827723bcc8b7fd0b271167ea4a458e6452ab898 | 377 | 182 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/sudoku.py | sudoku/seed=101000403/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | abf248c278bc37fec78ac3f9bcf1c2a5a80ba51c90ae30559befaf45f43c6b66 | Solve this Sudoku puzzle:
6 2 _ 1 9 8 4 3 7
_ 8 9 4 3 2 1 6 5
1 3 _ 5 6 7 8 9 _
8 4 1 6 _ 9 2 _ 3
9 _ 7 2 _ 3 _ 1 8
_ 6 3 _ _ 1 _ 4 9
3 1 _ 9 2 4 7 5 _
5 _ _ 3 1 6 _ 8 4
_ 9 6 8 _ 5 3 2 1
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | Not supported with pagination yet | [
"Select blank cells whose solved value is 1.",
"Select blank cells whose solved value is 2.",
"Select blank cells whose solved value is 3.",
"Select blank cells whose solved value is 4.",
"Select blank cells whose solved value is 5.",
"Select blank cells whose solved value is 6.",
"Select blank cells wh... | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select blank cells whose solved value is 1."},{"id":"q2","text":"Select blank cells whose solved value is 2."},{"id":"q3","text":"Select blank cells whose solved value is 3."},{"id":"q4","text":"Select blank cells whose solved value is 4.... | null | Apache-2.0 | null | null |
train-00031 | 101 | Reasoning Gym N-Queens | train | 31 | 0e37a715d60a0bf6523bdb1f8cff29c87336804b8bd58361d36a98171d9844a8 | 257 | 182 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000404/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 65ffde0b8982f2650799feee7383e7378fa9c78b503596e888d261161c4babf9 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":556,"end":557},{"kind":"span","start":586,"end":587}]}],"verification":{"status":"verified","method":"Official native gener... | null | Apache-2.0 | null | null |
train-00032 | 101 | Reasoning Gym N-Queens | train | 32 | cf4a4cd15873e35c272968f13ad7e0783f28a857bb65d57294effdb007637ac3 | 211 | 127 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000405/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | e10aaa53876bc59cec6baefd4f81af4fbc9bba3a238603e4ef17eb198a6967f6 | Navigate from 'V' (start) to 'a' (goal):
```
vvvvvvvvvv
vv-v--v-vv
v--Vv---vv
v--vvv-v-v
v-vv---vvv
v----v-avv
vvvv---vvv
v---vv--vv
v-----v--v
vvvvvvvvvv
```
Legend: 'v' = Wall, '-' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or f... | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":69,"end":70},{"kind":"span","start":70,"end":71},{"kind":"span","start":71,"end":72},{"kind... | null | Apache-2.0 | null | null |
train-00033 | 101 | Reasoning Gym N-Queens | train | 33 | ec076d61631cfdabda73ab2336353b58d5982c6045ba897f7d21ebf01415c178 | 211 | 127 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000408/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 4d0eef05eed4ce5f67988821318b58a003e414eaa459d8a763d29477b2a5650c | Navigate from '-' (start) to 'H' (goal):
```
aaaaaaaaaaaa
aafaaaffaaaa
aaaffffaafaa
aaffaffffafa
aaHafaafaaaa
aaffaaaffafa
afafa-aafafa
aafaaffffffa
afaffaaffaaa
aaaafaafaafa
aafafaaffffa
aaaaaaaaaaaa
```
Legend: 'a' = Wall, 'f' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of ... | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":75,"end":76},{"kind":"span","start":76,"end":77},{"kind":"span","start":77,"end":78},{"kind... | null | Apache-2.0 | null | null |
train-00034 | 101 | Reasoning Gym N-Queens | train | 34 | 4d8fe4fe41ef2f591c45447c1d7fcd4d83a5a56122c7cdcdfd30cb9a20c5cf5d | 356 | 161 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/sudoku.py | sudoku/seed=101000409/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | c3f0329691d4a3f4229ce2b759fa80c840f7701d39bbf47b93e6fae65085f650 | Solve this Sudoku puzzle:
1 9 8 _ 2 4 _ 6 7
3 4 7 8 _ 6 1 _ 9
2 _ _ 1 9 7 3 _ 4
8 1 _ _ _ 3 _ _ 6
_ _ _ _ 6 1 _ _ 8
6 _ _ 9 _ _ _ _ 3
9 _ 4 _ _ _ 6 _ _
_ _ 6 4 _ _ _ 9 2
7 _ 1 _ 3 _ _ 4 _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | Not supported with pagination yet | [
"Select blank cells whose solved value is 1.",
"Select blank cells whose solved value is 2.",
"Select blank cells whose solved value is 3.",
"Select blank cells whose solved value is 4.",
"Select blank cells whose solved value is 5.",
"Select blank cells whose solved value is 6.",
"Select blank cells wh... | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select blank cells whose solved value is 1."},{"id":"q2","text":"Select blank cells whose solved value is 2."},{"id":"q3","text":"Select blank cells whose solved value is 3."},{"id":"q4","text":"Select blank cells whose solved value is 4.... | null | Apache-2.0 | null | null |
train-00035 | 101 | Reasoning Gym N-Queens | train | 35 | 232513c7758d6a3f695c69879a69b5822771af2bc502ed23c633b4df043b7bbb | 171 | 87 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000411/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 31e8df30f1d6549c5035c5ee5a6636359f91f1d70b6a5aa0f8a204167abdc519 | Navigate from '4' (start) to ')' (goal):
```
[[[[[[
[4ZZ[[
[[[ZZ[
[[ZZ[[
[[)ZZ[
[[[[[[
```
Legend: '[' = Wall, 'Z' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answer, no other text or formatting. | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":54,"end":55},{"kind":"span","start":55,"end":56},{"kind":"span","start":56,"end":57},{"kind... | null | Apache-2.0 | null | null |
train-00036 | 101 | Reasoning Gym N-Queens | train | 36 | 81bf0123260e62448377f2b099a90f85f5f879fecf40586e303dbdc61ae17c72 | 352 | 157 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/sudoku.py | sudoku/seed=101000412/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 4ae54b44fcc2778f910cebdd5c29643a07b70ec4ebfa8a62e7864690df1682da | Solve this Sudoku puzzle:
_ 5 _ 8 _ _ _ _ _
3 _ 8 _ 4 7 _ 5 _
_ 6 4 _ _ 9 _ 8 _
_ 1 _ 2 9 8 5 6 _
_ 8 _ _ _ _ 9 1 _
9 _ 2 _ 6 _ _ _ _
_ _ _ _ _ _ 3 _ _
_ 4 _ _ 3 _ 6 _ 5
6 _ 7 _ 1 _ _ 2 8
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | Not supported with pagination yet | [
"Select blank cells whose solved value is 1.",
"Select blank cells whose solved value is 2.",
"Select blank cells whose solved value is 3.",
"Select blank cells whose solved value is 4.",
"Select blank cells whose solved value is 5.",
"Select blank cells whose solved value is 6.",
"Select blank cells wh... | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select blank cells whose solved value is 1."},{"id":"q2","text":"Select blank cells whose solved value is 2."},{"id":"q3","text":"Select blank cells whose solved value is 3."},{"id":"q4","text":"Select blank cells whose solved value is 4.... | null | Apache-2.0 | null | null |
train-00037 | 101 | Reasoning Gym N-Queens | train | 37 | d5efec573f5a6c58f76eccc32b70b6123d9a65a0cbf323f0f2f5b0704bd56842 | 243 | 168 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000413/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | cede397b8d0d007fb39c7a10af637f0631f1ef0b727d41bfcef7c0e294bc5a09 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":530,"end":531},{"kind":"span","start":552,"end":553},{"kind":"span","start":574,"end":575}]}],"verification":{"status":"ver... | null | Apache-2.0 | null | null |
train-00038 | 101 | Reasoning Gym N-Queens | train | 38 | be7f67bb2564e6c8d821aefe5b86c32488144b5d08e8461f7c607f535f5eac68 | 239 | 155 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000414/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 2a28b042dac5fd48ab43151b5a0f655f60524d65d824fc90fa1a831332f09d53 | Navigate from 't' (start) to 'J' (goal):
```
QQQQQQQQQQQ
Q^^^^^Q^Q^Q
Q^t^^^^^Q^Q
QQ^Q^^QQ^^Q
Q^Q^^^^^Q^Q
Q^^^Q^^^^^Q
Q^^^^Q^Q^^Q
Q^^^Q^Q^^JQ
Q^Q^^QQ^^^Q
Q^^Q^^QQ^QQ
QQQQQQQQQQQ
```
Legend: 'Q' = Wall, '^' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answ... | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":72,"end":73},{"kind":"span","start":73,"end":74},{"kind":"span","start":74,"end":75},{"kind... | null | Apache-2.0 | null | null |
train-00039 | 101 | Reasoning Gym N-Queens | train | 39 | 7a5d252ef255098b39c234e7874d98e5b3338466b13a3df12dcbe4692e4362e4 | 257 | 182 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000416/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 784770cc326c3b771208b01383515f36c885f35b51b3c927d644cfa250078b95 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":528,"end":529},{"kind":"span","start":552,"end":553},{"kind":"span","start":562,"end":563},{"kind":"span","start":572,"end"... | null | Apache-2.0 | null | null |
train-00040 | 101 | Reasoning Gym N-Queens | train | 40 | 18ff8d3ffad780b73a41711c5aa524ddce2b03effdedac3b16060294b0149c71 | 232 | 148 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000417/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 8e8e0c795779dbfcb3ba02864df715ab30601db279d0770f3962deeea63f0021 | Navigate from '/' (start) to '*' (goal):
```
AAAAAAAAAAAAA
A##A##A#####A
A#AA########A
A###AA#A#A#AA
A###########A
AA####A####AA
AAAA##A#####A
A#A##/A#AA#AA
A###AA######A
AA##A###A#*#A
A#####A#A##AA
AA####A#####A
AAAAAAAAAAAAA
```
Legend: 'A' = Wall, '#' = Passage
What is the minimum number of steps to reach the goal... | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":107,"end":108},{"kind":"span","start":108,"end":109},{"kind":"span","start":109,"end":110},... | null | Apache-2.0 | null | null |
train-00041 | 101 | Reasoning Gym N-Queens | train | 41 | eeef3da03c41dc30c38f1b36d71cf00457be448f6e4a2d25ab6ea071e901ca65 | 366 | 171 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/sudoku.py | sudoku/seed=101000418/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 3a31df3cd4937da6ef449fa017620b387db328a3487bfd0fa0b599e46d998d41 | Solve this Sudoku puzzle:
4 _ _ 1 _ _ 6 2 7
1 _ _ 4 9 6 8 3 _
3 6 8 2 7 _ _ 9 _
9 _ 5 8 1 2 _ 7 6
2 7 _ 5 3 4 9 8 1
_ 1 _ _ 6 _ 3 5 2
_ 4 _ _ 2 _ _ 1 _
6 9 _ _ _ 1 7 _ 8
5 8 1 7 4 _ 2 _ _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | Not supported with pagination yet | [
"Select blank cells whose solved value is 1.",
"Select blank cells whose solved value is 2.",
"Select blank cells whose solved value is 3.",
"Select blank cells whose solved value is 4.",
"Select blank cells whose solved value is 5.",
"Select blank cells whose solved value is 6.",
"Select blank cells wh... | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select blank cells whose solved value is 1."},{"id":"q2","text":"Select blank cells whose solved value is 2."},{"id":"q3","text":"Select blank cells whose solved value is 3."},{"id":"q4","text":"Select blank cells whose solved value is 4.... | null | Apache-2.0 | null | null |
train-00042 | 101 | Reasoning Gym N-Queens | train | 42 | 74802d68538bc86b199bc8d2e1a4d82982988075633b11f828b2363fa7282130 | 273 | 198 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000419/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 27b94c92db58c6d775e957a32dd48608d7aea4d54958b1e2353f6c9471c32611 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":542,"end":543},{"kind":"span","start":572,"end":573},{"kind":"span","start":618,"end":619},{"kind":"span","start":626,"end"... | null | Apache-2.0 | null | null |
train-00043 | 101 | Reasoning Gym N-Queens | train | 43 | 8afc7b65f61e47ba5b4408e658b714de39e65a08e9e10d3cf2e46bb679e3012b | 357 | 162 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/sudoku.py | sudoku/seed=101000421/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 6fb5d731560240476f69911aac181e8a74a6dd6062107490a7e083cebbd8af1d | Solve this Sudoku puzzle:
_ _ 9 1 8 _ 4 _ 7
7 _ _ _ _ _ _ 3 2
6 _ 8 _ _ _ 1 _ _
1 9 _ _ _ 2 _ _ 4
_ 7 4 8 9 6 3 2 1
2 _ _ _ _ _ _ 7 _
8 1 2 _ _ 3 7 _ 6
_ _ _ _ 7 _ 2 4 8
4 _ 7 5 _ 8 9 1 _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | Not supported with pagination yet | [
"Select blank cells whose solved value is 1.",
"Select blank cells whose solved value is 2.",
"Select blank cells whose solved value is 3.",
"Select blank cells whose solved value is 4.",
"Select blank cells whose solved value is 5.",
"Select blank cells whose solved value is 6.",
"Select blank cells wh... | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select blank cells whose solved value is 1."},{"id":"q2","text":"Select blank cells whose solved value is 2."},{"id":"q3","text":"Select blank cells whose solved value is 3."},{"id":"q4","text":"Select blank cells whose solved value is 4.... | null | Apache-2.0 | null | null |
train-00044 | 101 | Reasoning Gym N-Queens | train | 44 | 489bd06f99fd694ddb266150633204e1de7ed1bc5f2e78b963e3b6d485567b04 | 211 | 127 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000423/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 815e6827cb8a633916a45276ac95dc6a6932aa6658b5db8bbc19d38cb38b1ba1 | Navigate from 'R' (start) to '`' (goal):
```
xxxxxxxxxxx
xxx***xx**x
x*xx`x*x*Rx
x**x**xx*xx
xxxx*****xx
xxxxx*xx*xx
x*xx*x*xxxx
xx*xxxx*xxx
x***xx***xx
xx**x*x*xxx
xxxxxxxxxxx
```
Legend: 'x' = Wall, '*' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answ... | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":74,"end":75},{"kind":"span","start":78,"end":79},{"kind":"span","start":79,"end":80},{"kind... | null | Apache-2.0 | null | null |
train-00045 | 101 | Reasoning Gym N-Queens | train | 45 | 254cdf171f20e3624641e2b168c09555738b6a840ae9db88cdde3c4d322e1235 | 351 | 156 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/sudoku.py | sudoku/seed=101000424/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 976e6561a9c57d6e9a693e1be9f8166ded054fb5f6803cb80c0c3c3e3055891b | Solve this Sudoku puzzle:
_ _ 8 _ 1 _ 6 _ 7
4 _ 1 _ 6 _ 2 _ _
_ _ _ _ _ 5 _ _ _
_ _ 7 8 5 _ 3 _ 4
8 _ 6 1 _ _ _ _ 2
9 4 _ 7 _ 3 _ _ _
_ 7 4 _ _ _ 1 2 _
_ 1 _ 2 7 _ _ 5 8
2 _ _ _ _ _ _ 6 _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | Not supported with pagination yet | [
"Select blank cells whose solved value is 1.",
"Select blank cells whose solved value is 2.",
"Select blank cells whose solved value is 3.",
"Select blank cells whose solved value is 4.",
"Select blank cells whose solved value is 5.",
"Select blank cells whose solved value is 6.",
"Select blank cells wh... | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select blank cells whose solved value is 1."},{"id":"q2","text":"Select blank cells whose solved value is 2."},{"id":"q3","text":"Select blank cells whose solved value is 3."},{"id":"q4","text":"Select blank cells whose solved value is 4.... | null | Apache-2.0 | null | null |
train-00046 | 101 | Reasoning Gym N-Queens | train | 46 | dd9f8b856105d497af7b708de22c205ed20a94970ec0bf16f9e6de41b8be53f2 | 243 | 168 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000425/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 4dc460a70623c374930e7afde1fad9a1cdbfec57dda70693f2b204a14bf26400 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":532,"end":533},{"kind":"span","start":538,"end":539},{"kind":"span","start":558,"end":559},{"kind":"span","start":564,"end"... | null | Apache-2.0 | null | null |
train-00047 | 101 | Reasoning Gym N-Queens | train | 47 | 76ab77f5947100b9876dfe1d8ee0fafa9e46413d95020b9dbf4315435ba15563 | 257 | 173 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000426/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 1b87154b3d19bdc9fa1ea5a87a9cf7d95db27f01ff6db67fde985d4b971187f3 | Navigate from 'C' (start) to 'q' (goal):
```
<<<<<<<<<<<<<<
<WWWW<<<WWCWW<
<<W<<W<<<W<WW<
<WW<<<W<<W<W<<
<<<W<<<<WW<W<<
<<<<<<W<WWWWW<
<WW<WW<q<<W<<<
<<<W<W<WWWW<<<
<W<<<W<<W<<W<<
<<WW<WWWW<<W<<
<<<<<<W<W<WW<<
<<<W<W<W<<W<W<
<W<<<WWW<<<<<<
<<<<<<<<<<<<<<
```
Legend: '<' = Wall, 'W' = Passage
What is the minimum numbe... | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":70,"end":71},{"kind":"span","start":71,"end":72},{"kind":"span","start":72,"end":73},{"kind... | null | Apache-2.0 | null | null |
train-00048 | 101 | Reasoning Gym N-Queens | train | 48 | 860c5e678f733f9e8b83954d07cfab6e2f50e1fcb5e64031199ed165a12effa0 | 378 | 183 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/sudoku.py | sudoku/seed=101000427/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 3a3d563d7720078e48c7e54a2f4bda2b28b1857e1ec2766ec96e6d0af2b0d96e | Solve this Sudoku puzzle:
_ _ 1 8 9 2 4 7 6
9 4 7 1 _ 3 _ _ 2
6 _ 8 4 _ 5 1 9 _
8 _ 3 9 2 4 7 6 5
_ 5 6 7 1 _ _ 4 9
_ 7 9 _ 5 6 2 _ _
1 6 5 2 8 7 9 3 4
3 8 2 6 4 9 5 1 _
_ 9 4 5 3 1 _ _ 8
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | Not supported with pagination yet | [
"Select blank cells whose solved value is 1.",
"Select blank cells whose solved value is 2.",
"Select blank cells whose solved value is 3.",
"Select blank cells whose solved value is 4.",
"Select blank cells whose solved value is 5.",
"Select blank cells whose solved value is 6.",
"Select blank cells wh... | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select blank cells whose solved value is 1."},{"id":"q2","text":"Select blank cells whose solved value is 2."},{"id":"q3","text":"Select blank cells whose solved value is 3."},{"id":"q4","text":"Select blank cells whose solved value is 4.... | null | Apache-2.0 | null | null |
train-00049 | 101 | Reasoning Gym N-Queens | train | 49 | c9f56b1d21d1012f20c2b816f038f57d820d380b960719e56fda72b50f04fbcb | 257 | 182 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000428/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 197239e817314a26674b6a8ce0e6bb9bc767029734cadf984445113ed3ee63f4 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":532,"end":533},{"kind":"span","start":550,"end":551},{"kind":"span","start":554,"end":555},{"kind":"span","start":572,"end"... | null | Apache-2.0 | null | null |
train-00050 | 101 | Reasoning Gym N-Queens | train | 50 | 819acc57e675197ebb98d6702f1e2190932473f289a08a97c0c2e070f2cf217e | 367 | 172 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/sudoku.py | sudoku/seed=101000430/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 63c041034531827a1d14c88bffb2d15191e39aa4151e807349d8041bee9b16b6 | Solve this Sudoku puzzle:
8 7 4 _ 2 _ 5 _ _
_ 9 3 5 8 6 4 _ 7
6 2 _ 4 7 3 8 _ 9
_ _ 8 _ 5 2 7 4 1
4 _ 7 8 _ _ _ 3 2
2 1 6 _ 3 4 9 _ 8
7 4 _ 3 6 8 _ _ _
5 6 9 _ 1 7 _ _ _
_ 8 _ _ 4 5 1 _ _
Respond with only your answer, formatted as the puzzle, a 9x9 grid with numbers separated by spaces, and rows separated by newlines. | Not supported with pagination yet | [
"Select blank cells whose solved value is 1.",
"Select blank cells whose solved value is 2.",
"Select blank cells whose solved value is 3.",
"Select blank cells whose solved value is 4.",
"Select blank cells whose solved value is 5.",
"Select blank cells whose solved value is 6.",
"Select blank cells wh... | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select blank cells whose solved value is 1."},{"id":"q2","text":"Select blank cells whose solved value is 2."},{"id":"q3","text":"Select blank cells whose solved value is 3."},{"id":"q4","text":"Select blank cells whose solved value is 4.... | null | Apache-2.0 | null | null |
train-00051 | 101 | Reasoning Gym N-Queens | train | 51 | 13b1920f62648e1763b72e9a9c278a29d46788d265c9dec91f1aaf16b9ec7043 | 273 | 198 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/n_queens.py | n_queens/seed=101000431/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 1828d8b9d6e33880f13515e944dd9b2cf478904cefee6a7bfcf3529a14d67e73 | Your job is to complete an n x n chess board with n Queens in total, such that no two attack each other.
No two queens attack each other if they are not in the same row, column, or diagonal.
You can place a queen by replacing an underscore (_) with a Q.
Your output should be also a board in the same format as the in... | Not supported with pagination yet | [
"Select all missing queen positions for one complete legal placement."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select all missing queen positions for one complete legal placement."}],"solutions":[{"q1":[{"kind":"span","start":560,"end":561},{"kind":"span","start":588,"end":589}]}],"verification":{"status":"verified","method":"Official native gener... | null | Apache-2.0 | null | null |
train-00052 | 101 | Reasoning Gym N-Queens | train | 52 | 8e648510ea1db92fcfdf13a6a055807eea7feb912b8fa454ad8d5419634bb652 | 265 | 181 | text | dense | https://github.com/open-thought/reasoning-gym/blob/49b07130b3fcd12f2d064bba7c43869543a0e7e7/reasoning_gym/games/maze.py | maze/seed=101000432/index=0 | 49b07130b3fcd12f2d064bba7c43869543a0e7e7 | 953e97a8c2624eebea35b84f6b2c565d92d7280e2b05f9946148b28d2ab1d1d1 | Navigate from 'l' (start) to ',' (goal):
```
66666666666
6jj6jjj66j6
666j6jj6jj6
6jjj6lj6666
666j6j6j6j6
666jjj66jj6
6jjjjjjj666
66j666jj666
6jjj,666j66
66j6j66j666
66666666666
```
Legend: '6' = Wall, 'j' = Passage
What is the minimum number of steps to reach the goal?
Give only the number of steps as your final answ... | Not supported with pagination yet | [
"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."
] | false | Read the complete puzzle statement in the source and apply its constraints to the displayed instance. Select the original source positions for one complete valid completion. | {"id":101,"title":"Reasoning Gym","modality":"text","queries":[{"id":"q1","text":"Select every grid cell lying on at least one shortest route from start to goal, including endpoints."}],"solutions":[{"q1":[{"kind":"span","start":87,"end":88},{"kind":"span","start":99,"end":100},{"kind":"span","start":109,"end":110},{"k... | null | Apache-2.0 | null | null |
End of preview. Expand in Data Studio
SEL 27B training data
SEL learns to select positions in source text and images in response to a question. Tasks include choosing evidence for an answer, solving mazes, finding legal game moves, and grounding linked actions. This dataset records the inputs and supervision used to train SEL Qwen 27B at checkpoint 7,811.
| Configuration | Tasks | Train | Validation | Test | Total |
|---|---|---|---|---|---|
| Public records | 22 | 28,441 | 1,651 | 2,265 | 32,357 |
| Full run source index | 26 | 31,244 | 1,987 | 2,605 | 35,836 |
Rows keep their original split, within-split order and grouping identifier. The full-run index also identifies the 3,479 examples from Math-Shepherd, SWE-Gym, AndroidControl and Android in the Wild whose source payloads are held upstream. The public training split contains 10,084,455 input tokens. The original training split contained 11,809,855. Sources and redistribution terms
Read the data
from datasets import load_dataset
records = load_dataset("spock-oss/sel-27b-training", split="train", streaming=True)
example = next(iter(records))
print(example["task"], example["queries"])
source_text or image is the selectable input. queries are the literal questions. environment_prompt describes task rules when present, and query_first controls source/question order. input_tokens includes the task rules and visual tokens. source_units counts only selectable text tokens or image patches. The maximum training input length is 2,048 tokens.
record_json stores the source-aligned labels. Each item in solutions is one complete acceptable answer, keyed by question ID. Text spans use half-open character offsets. Image boxes and points use source pixel coordinates. A point radius is in pixels. The selection modes are dense, one_coherent_answer, and linked. Alternatives are complete answers and should be evaluated independently.
Train with the standalone SEL code
Install the SEL CLI and PyArrow, then download and materialize the public records.
uv pip install pyarrow
hf download spock-oss/sel-27b-training --repo-type dataset \
--include 'data/*.parquet' materialize.py --local-dir sel-hf
python sel-hf/materialize.py sel-hf sel-records
sel prepare --source sel-records --output sel-packed
CUDA_VISIBLE_DEVICES=0 sel train --data sel-packed --output sel-run
manifest.json lists the task breakdown and token counts. SOURCES.md records upstream terms and attributions.
- Downloads last month
- 79