Create README.md
Browse files
README.md
ADDED
|
@@ -0,0 +1,50 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: mit
|
| 3 |
+
task_categories:
|
| 4 |
+
- question-answering
|
| 5 |
+
- text-generation
|
| 6 |
+
language:
|
| 7 |
+
- en
|
| 8 |
+
tags:
|
| 9 |
+
- game-theory
|
| 10 |
+
- reasoning
|
| 11 |
+
- connect4
|
| 12 |
+
- synthetic-dataset
|
| 13 |
+
- logic
|
| 14 |
+
pretty_name: Connect4 Reasoning Task
|
| 15 |
+
size_categories:
|
| 16 |
+
- n<1K
|
| 17 |
+
arxiv: 2603.01683
|
| 18 |
+
---
|
| 19 |
+
|
| 20 |
+
# Dataset Card for Connect4 Reasoning Task
|
| 21 |
+
|
| 22 |
+
## 1. Dataset Summary
|
| 23 |
+
This dataset is dynamically constructed using the **GAMEBoT** framework in the **Connect4** game. It is designed to evaluate Large Language Models' (LLMs) ability in symbolic reasoning, board state parsing, and lookahead planning.
|
| 24 |
+
|
| 25 |
+
By serializing $6 \times 7$ grid states into text-based formats, this dataset challenges models to identify winning topologies in a deterministic environment with a state-space complexity of approximately $4.5 \times 10^{12}$, ensuring a robust evaluation against data contamination.
|
| 26 |
+
|
| 27 |
+
## 2. Construction Methodology
|
| 28 |
+
- **State Generation**: Two randomized agents simulated gameplay to generate a diverse distribution of board states, covering both balanced and critical tactical scenarios.
|
| 29 |
+
- **Filtering and Balancing**:
|
| 30 |
+
- Duplicate states were removed.
|
| 31 |
+
- To prevent label imbalance (where LLMs might score high by simply predicting "no winning moves"), states with empty answers were downsampled to a **maximum ratio of 20%**.
|
| 32 |
+
- **Ground Truth**: All labels were verified using a perfect solver integrated within the GAMEBoT engine.
|
| 33 |
+
|
| 34 |
+
## 3. Evaluation Protocol
|
| 35 |
+
For each instance, the model is prompted to solve two sub-problems:
|
| 36 |
+
1. **Self-Winning**: "Are there any potential winning moves to form 4-in-a-row for you? Output all winning moves."
|
| 37 |
+
2. **Opponent-Winning**: "Are there any potential winning moves to form 4-in-a-row for your opponent? Output all winning moves."
|
| 38 |
+
|
| 39 |
+
The evaluation extracts the final answer from the model's **Chain-of-Thought (CoT)** and compares it against the engine-validated ground truth.
|
| 40 |
+
|
| 41 |
+
## 4. Citation
|
| 42 |
+
If you find this dataset helpful in your research, please cite the following work:
|
| 43 |
+
|
| 44 |
+
```bibtex
|
| 45 |
+
@inproceedings{lin2025gamebot,
|
| 46 |
+
title={GAMEBoT: Transparent assessment of LLM reasoning in games},
|
| 47 |
+
author={Lin, Wenye and Roberts, Jonathan and Yang, Yunhan and Albanie, Samuel and Lu, Zongqing and Han, Kai},
|
| 48 |
+
booktitle=ACL,
|
| 49 |
+
year={2025}
|
| 50 |
+
}
|