@BenjaminDEKR: Can Jev solve a maze? I gave it a 14×14 braided maze: randomized Prim's, ~52 junctions, loops knocked through the dead …

X AI KOLs Timeline News

Summary

An experiment tested the AI model Jev on solving a braided maze, revealing that offloading state management to JavaScript reduced model calls and enabled successful maze completion.

Can Jev solve a maze? I gave it a 14×14 braided maze: randomized Prim's, ~52 junctions, loops knocked through the dead ends so there's no single path to follow. Attempt 1: ask Jev which way to go, every step. Every legal direction on the table, including back the way it came. 60 calls. 60 steps. Gave up. It never escaped a 7-cell corridor in the top-left. It just paced back and forth, 60 times, at 96% confidence. Attempt 2: I moved the state out of the model. The DFS stack and the visited set live in JavaScript. Corridors and dead ends resolve with no call at all. Jev gets asked exactly one thing, and only at genuine junctions: which unexplored opening leads towards the exit? 22 calls. 56 steps. Solved. 2.2× optimal. Same model. Same question type. Same difficulty. A third of the calls and it actually gets out. The model isn't a search algorithm. It has no memory of where it's been and no way to backtrack, so if you ask it to search, it paces. Give the code the memory and the model the judgment, and it works.
Original Article
View Cached Full Text

Cached at: 09/21/26, 05:30 AM

Can Jev solve a maze?

I gave it a 14×14 braided maze: randomized Prim’s, ~52 junctions, loops knocked through the dead ends so there’s no single path to follow.

Attempt 1: ask Jev which way to go, every step. Every legal direction on the table, including back the way it came.

60 calls. 60 steps. Gave up. It never escaped a 7-cell corridor in the top-left. It just paced back and forth, 60 times, at 96% confidence.

Attempt 2: I moved the state out of the model. The DFS stack and the visited set live in JavaScript. Corridors and dead ends resolve with no call at all.

Jev gets asked exactly one thing, and only at genuine junctions: which unexplored opening leads towards the exit?

22 calls. 56 steps. Solved. 2.2× optimal.

Same model. Same question type. Same difficulty. A third of the calls and it actually gets out.

The model isn’t a search algorithm. It has no memory of where it’s been and no way to backtrack, so if you ask it to search, it paces.

Give the code the memory and the model the judgment, and it works.

Similar Articles

I turned Qwen3.8-27B Q2_64 + llama.cpp into a fully TypeSafe AI-compatible Jev-like system. OpenAI API still intact! World’s first Vision-enabled Jev-like model! <10 GB VRAM, 170 ms on an RTX 3090 and ~140 tok/s in chat. 76% vs. 88% Jev-1.13 Acc. on a diverse 22,000-request typed-decision benchmark

Reddit r/LocalLLaMA

Bonsai-Llama-Jev is an open-source, vision-enabled typed-decision inference system that runs locally with low VRAM and high accuracy, outperforming other systems in a diverse benchmark.