This paper presents 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 (SMT) as global constraints on adjacency, continuity, and pattern-constrained coverage, allowing each fixed-bound instance to be solved in a single call. The resulting path can either be a planar, self-avoiding route or a layered traversal with prescribed over-under crossings, serving as a scaffold for constructing planar mazes and three-dimensional realizations of woven mazes. This report extends the previously published Bridges 2026 conference paper with more representative SMT-LIB examples and a fuller account of how synthesized paths become concrete maze constructions in both planar and three-dimensional forms.
Blogger's Review: This research showcases the powerful application of SMT in generating maze structures, highlighting the complexity and aesthetic potential of path synthesis. By optimizing maze design through global constraints, this work may play a significant role in automation design and game development. The introduction of richer examples provides valuable references for related fields.