Upload folder using huggingface_hub
Browse files- README.md +24 -2
- dataset.json +0 -0
- dataset.jsonl +0 -0
- dataset.parquet +2 -2
- dataset_info.json +4 -3
README.md
CHANGED
|
@@ -1,6 +1,22 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
# Rush Hour 4x4 Evaluation Dataset
|
| 2 |
|
| 3 |
-
This dataset contains 4x4 Rush Hour puzzles for model evaluation.
|
| 4 |
|
| 5 |
## Format
|
| 6 |
|
|
@@ -8,6 +24,7 @@ This dataset contains 4x4 Rush Hour puzzles for model evaluation.
|
|
| 8 |
- **prompt**: Full formatted prompt as used in model inference
|
| 9 |
- **solution**: Optimal solution with proper formatting
|
| 10 |
- **optimal_moves**: Number of moves in optimal solution
|
|
|
|
| 11 |
|
| 12 |
## Usage
|
| 13 |
|
|
@@ -26,4 +43,9 @@ Perfect for evaluating reasoning capabilities of language models on spatial puzz
|
|
| 26 |
- **dataset.json**: Complete JSON array format (150 entries)
|
| 27 |
- **dataset_info.json**: Dataset metadata
|
| 28 |
|
| 29 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: mit
|
| 3 |
+
task_categories:
|
| 4 |
+
- question-answering
|
| 5 |
+
language:
|
| 6 |
+
- en
|
| 7 |
+
size_categories:
|
| 8 |
+
- 100<n<1K
|
| 9 |
+
tags:
|
| 10 |
+
- puzzle
|
| 11 |
+
- reasoning
|
| 12 |
+
- evaluation
|
| 13 |
+
- games
|
| 14 |
+
- spatial-reasoning
|
| 15 |
+
---
|
| 16 |
+
|
| 17 |
# Rush Hour 4x4 Evaluation Dataset
|
| 18 |
|
| 19 |
+
This dataset contains 150 4x4 Rush Hour puzzles for model evaluation with difficulty labels.
|
| 20 |
|
| 21 |
## Format
|
| 22 |
|
|
|
|
| 24 |
- **prompt**: Full formatted prompt as used in model inference
|
| 25 |
- **solution**: Optimal solution with proper formatting
|
| 26 |
- **optimal_moves**: Number of moves in optimal solution
|
| 27 |
+
- **difficulty**: Difficulty level (easy, medium, hard)
|
| 28 |
|
| 29 |
## Usage
|
| 30 |
|
|
|
|
| 43 |
- **dataset.json**: Complete JSON array format (150 entries)
|
| 44 |
- **dataset_info.json**: Dataset metadata
|
| 45 |
|
| 46 |
+
## Dataset Statistics
|
| 47 |
+
|
| 48 |
+
- Total puzzles: 150
|
| 49 |
+
- Difficulty levels: Easy (50), Medium (50), Hard (50)
|
| 50 |
+
- Grid size: 4x4
|
| 51 |
+
- Optimal solution length: 1-15 moves
|
dataset.json
CHANGED
|
The diff for this file is too large to render.
See raw diff
|
|
|
dataset.jsonl
CHANGED
|
The diff for this file is too large to render.
See raw diff
|
|
|
dataset.parquet
CHANGED
|
@@ -1,3 +1,3 @@
|
|
| 1 |
version https://git-lfs.github.com/spec/v1
|
| 2 |
-
oid sha256:
|
| 3 |
-
size
|
|
|
|
| 1 |
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:254d2874c63c697fd3575860af8bcb20e021ce74b938ecc2591af4f483ac94cf
|
| 3 |
+
size 49922
|
dataset_info.json
CHANGED
|
@@ -1,12 +1,13 @@
|
|
| 1 |
{
|
| 2 |
"name": "rushhour4x4-eval",
|
| 3 |
-
"description": "4x4 Rush Hour puzzle dataset for evaluation",
|
| 4 |
"num_examples": 150,
|
| 5 |
"columns": {
|
| 6 |
"puzzle_id": "Unique identifier for each puzzle (e.g., puzzle1, puzzle2, ...)",
|
| 7 |
"prompt": "Full formatted prompt as used in model inference, including grid state and instructions",
|
| 8 |
"solution": "Optimal solution in the expected format with <solution> tags",
|
| 9 |
-
"optimal_moves": "Number of moves in the optimal solution (integer)"
|
|
|
|
| 10 |
},
|
| 11 |
-
"format": "Each row represents one puzzle with its prompt, solution,
|
| 12 |
}
|
|
|
|
| 1 |
{
|
| 2 |
"name": "rushhour4x4-eval",
|
| 3 |
+
"description": "4x4 Rush Hour puzzle dataset for evaluation with difficulty labels",
|
| 4 |
"num_examples": 150,
|
| 5 |
"columns": {
|
| 6 |
"puzzle_id": "Unique identifier for each puzzle (e.g., puzzle1, puzzle2, ...)",
|
| 7 |
"prompt": "Full formatted prompt as used in model inference, including grid state and instructions",
|
| 8 |
"solution": "Optimal solution in the expected format with <solution> tags",
|
| 9 |
+
"optimal_moves": "Number of moves in the optimal solution (integer)",
|
| 10 |
+
"difficulty": "Difficulty level: easy, medium, or hard"
|
| 11 |
},
|
| 12 |
+
"format": "Each row represents one puzzle with its prompt, solution, optimal move count, and difficulty"
|
| 13 |
}
|