AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

The Simultaneous Maze Solving Problem

Stefan Funke, Andre Nusser, Sabine Storandt

AAAI 2017 · Learning theory and algorithms › Sample complexity · approach: Computational thresholds in graphs and structure · 4 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use IAS instead of random sequence (RS) heuristicASIMASOP heuristics · ASIMASOP 4x4 mazesruntime (s): 170.7 -> 0.3Improved
use SO instead of IASASIMASOP heuristics · ASIMASOP 4x4 mazessolving sequence length: 109 -> 50Improved
use SO instead of IASASIMASOP heuristics · ASIMASOP 4x4 mazesruntime (s): 0.3 -> 842.3Hurt
minimize the found sequence (ablation)SO · ASIMASOP 4x4 mazessolving sequence length: 50 -> 29Improved
minimize the found sequence (ablation)RS · ASIMASOP 4x4 mazessolving sequence length: 250 -> 51Improved
minimize the found sequence (ablation)IAS · ASIMASOP 4x4 mazessolving sequence length: 109 -> 53Improved
use ESS instead of A* for exact solvingexact solver · ASIMASOP 3x4 mazesruntime (s): 99 -> 5Improved
use tree based unsolved-maze search instead of naive enumerationfinding unsolved mazes · 8x8 mazesfeasibilityImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy