From Patterns to Maze Structures: SMT-Based Path Synthesis and 2D/3D Construction
Quick Answer
This paper introduces a pipeline for maze structure construction using SMT-based path synthesis, addressing adjacency and continuity constraints.
Quick Take
The synthesized paths can be realized in both planar and 3D forms, enhancing maze design capabilities.
Key Points
- Utilizes Satisfiability Modulo Theories for path synthesis in maze construction.
- Supports both planar and 3D maze realizations with specified crossings.
- Extends previous work with more SMT-LIB examples for clarity.
- Addresses global constraints on adjacency, continuity, and coverage.
Paper Resources
📖 Reader Mode
~2 min readAbstract:We present a pipeline for constructing maze structures from input patterns such as text or shapes. The central path-synthesis problem is encoded in Satisfiability Modulo Theories as global constraints on adjacency, continuity, and pattern-constrained coverage, allowing each fixed-bound instance to be solved in one call. The resulting path is either a planar, self-avoiding route or a layered traversal with prescribed over--under crossings, and it serves as a scaffold for constructing planar mazes and three-dimensional realizations of woven mazes. This report extends the published Bridges 2026 conference paper with more representative SMT-LIB examples and a fuller account of how synthesized paths become concrete maze constructions in planar and three-dimensional form.
| Comments: | 14 pages, 7 figures |
| Subjects: | Artificial Intelligence (cs.AI); Logic in Computer Science (cs.LO) |
| ACM classes: | F.4.1; G.2.2; F.2.2 |
| Cite as: | arXiv:2607.09781 [cs.AI] |
| (or arXiv:2607.09781v1 [cs.AI] for this version) | |
| https://doi.org/10.48550/arXiv.2607.09781 arXiv-issued DOI via DataCite |
Submission history
From: Shengyi Wang [view email]
[v1]
Wed, 8 Jul 2026 12:42:27 UTC (537 KB)
— Originally published at arxiv.org
Want this in your inbox every morning?
Daily brief at your local 8am — bilingual EN/中文, free.
More from arXiv cs.AI
See more →HOBA: Hierarchical On-Policy Bidding Agents for Adaptive Online Advertising
HOBA (Hierarchical On-policy Bidding Agents) is a novel hierarchical reinforcement learning framework that enhances online advertising bidding systems by improving adaptability and reducing hyperparameter tuning costs. It utilizes a for hyperparameter inference, a SARSA agent for expert model selection, and a dynamic expert pool for bid execution, achieving a +3.6% increase in target cost during large-scale deployment and outperforming state-of-the-art baselines on AuctionNet.