Get the latest tech news
Solving a math problem with planner programming
More opportunities to mess with exotic technology
This is guaranteed to find a shortest possible solution due to a fun property of BFS: the distance of nodes to the origin never decreases. Because Picat is a research language it's a little weird with putting expressions inside structures. On the other hand, I can't get it to find a path that makes exactly 100,001 characters, even with some optimizations.
Or read this on Hacker News