Minesweeper with Limited Moves
Authors: Serge Gaspers, Stefan Rümmele, Abdallah Saffidine, Kevin Tran
AAAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Our main results are that the problem is PSPACE-complete, and it remains PSPACE-complete when p is a constant, in particular when p = 1. When k = 0 (i.e., we are not allowed to click anywhere), the problem is PP-complete in general, but co-NP-complete when p is a constant, and in particular when p = 1. |
| Researcher Affiliation | Academia | Serge Gaspers UNSW Sydney and Data61, CSIRO Australia Stefan R ummele UNSW Sydney and University of Sydney Australia Abdallah Saffidine UNSW Sydney, Australia Kevin Tran UNSW Sydney, Australia |
| Pseudocode | No | The paper describes logical gadgets and constructions in prose and with diagrams, but it does not include formal pseudocode blocks or algorithms. |
| Open Source Code | No | The paper does not provide any statement about releasing open-source code for the methodology described. |
| Open Datasets | No | The paper is theoretical and focuses on computational complexity. It does not involve empirical experiments with datasets, so there is no mention of dataset availability or access information. |
| Dataset Splits | No | The paper is theoretical and focuses on computational complexity. It does not involve empirical experiments with datasets, so there is no mention of training, validation, or test dataset splits. |
| Hardware Specification | No | The paper is theoretical and focuses on computational complexity proofs. It does not describe experiments that would require specific hardware, thus no hardware specifications are provided. |
| Software Dependencies | No | The paper is theoretical and focuses on computational complexity proofs. It does not describe empirical experiments that would rely on specific software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and focuses on computational complexity proofs. It does not involve empirical experiments that would require an experimental setup with hyperparameters or system-level training settings. |