Recursively apply patterns for pathfinding
Get picks like this daily. Today's launch numbers, the top launches, AI and tech news, and a daily opportunity pick, straight to your inbox.
Want to reach these readers? Sponsor an issue.
I've been begrudgingly working on autorouters for 2 years, looking for new techniques or modern methods that might allow AI to create circuit boards.One of the biggest problems in my view for training an AI to do autorouting is the traditional grid-based representation of autorouting problems which challenges spatial understanding. But we know that vision models are very good at classifying, so I wondered if we could train a model to output a path as a classification. But then how do you represent the path? This lead me down the track of trying to build an autorouter that represented paths as a bunch of patterns.More details: https://blog.autorouting.com/p/the-recursive-pattern-pathfin...
HN · launched Feb 24, 2026 · 26 upvotes (top 27%) · 0 views
Niche: specialized algorithms and computing libraries · 230 launches, 4 in the last 7 days ▼ -73% · Explore this niche →
Category and tags
- Horizontal
- Dev tools
- Developer
- Not AI
- Hobby / open-source project
Visit website ↗ Source listing ↗
More like this: all 230 launches in specialized algorithms and computing libraries →
Could you build this?
No Designing novel pathfinding algorithms and recursive pattern-based autorouting for printed circuit board (PCB) design is a complex domain in computational geometry and electronic design automation (EDA). This requires deep specialized algorithmic research that AI coding assistants cannot independently invent or solve.
What it would actually take: Building an AI-driven PCB autorouter requires deep knowledge of EDA physical design, computational geometry, and multi-layer routing heuristics (e.g., A*, negotiated-congestion routing, or reinforcement learning). The core pipeline requires a custom geometric engine, DRC (design rule check) validation, and spatial graph representations rather than naive 2D grids. Achieving production viability demands a team with PhD-level expertise in CAD/EDA algorithms and hardware engineering.
Discussion
5 comments analyzed.
Competitors mentioned: Polyanya/any-angle pathfinding, OpenROAD (chip design autorouting), Game developer pathfinding techniques
Concerns raised: Inefficiencies in AI autorouting results, Baked navmesh approach not equivalent to A* pathfinding, VLSI algorithms oriented toward repeated patterns, not typical PCBs
Feature requests: More academic papers/critical analysis of autorouting approaches, Design rule checking integration
Competitors
Other products that read as similar to this one : 212 launches clear the similarity bar, closest 8 shown.
Attention rank: #73 of 213 (itself plus its competitors, highest first, normalized so YC and Product Hunt are compared fairly).
Launched 118 days after the earliest competitor.
- ai-routing · github · 2026-11-06 · 22 upvotes · similarity 0.49
- GPU-Based Autorouting for KiCad · hn · 2025-10-29 · 8 upvotes · similarity 0.46
- vector · github · 2026-09-19 · 16 upvotes · similarity 0.43
- Pathwise · ph · 2026-09-11 · 1 upvotes · similarity 0.40
- Map Animation · ph · 2026-09-21 · 1 upvotes · similarity 0.40
- Pathfind · ph · 2026-11-12 · 2 upvotes · similarity 0.39
- Autostep - Uncover Repetitive Tasks Ready For AI · yc · 2026-02-27 · 33 upvotes · similarity 0.39
- pixel-path · github · 2026-10-12 · 201 upvotes · similarity 0.39
The niche, labels, vibe code rating and competitor comparison on this page are analysis by Nicheloom. If you use them, please credit nicheloom.com. How you may use our data.