Herbert plays snake (open Jev)

I never used Jev models until I came across this post yesterday. It's a Qwen 3.8 27B Lora that works as a decision model. OP (/u/Massive-Ice2791) was kind enough to merge it into the original model and provide a gguf. To test it out, I used QFN to create a playable snake game where it waits for the decision from the model for every move. And it works brilliantly. I'm amazed at how well it works and every decision is around 600ms. That's the speed from the app, but I'm traveling overseas and connected to my server running 5090 + 64GB RAM through ssh tunnel and weak wifi. I'm sure it could be faster locally. Here's a quick video that shows it working (sped up 4x). It ends quite early (370 ticks) unfortunately because of an unlucky dot. But I had it work up to 2200+ ticks before dying in one trial run. I'm sure there are many other optimizations that can be done (running on Q8, improving the prompt etc) to make it better. I know there are many other examples of openJev models running snake, but this was quite thrilling so I had to share it :). The way the snake app works is it gives 3 options to the model to choose: Turn left Turn right Stay course And in the prompt it provides a screenshot of the board along with a full text description of the distance to the snake body, the wall in each direction and the relative position of the dot to eat. The goal is to maximize the length of the snake and also not die. Here is an example prompt that QFN generated for the app (you can see it in the video also). For more details on the model, I suggest visiting the original post linked above. ``` State: Goal: make the snake as LONG as possible by eating dots. It grows one segment per dot and never stops moving; a collision with a wall or its own body ends the run, so staying alive is only the constraint on growth. Snake on a 15 by 15 grid. Head at column 10, row 4; length 39; heading East; dots eaten so far 36. Nearest dot at column 14, row 7: 7 cells away (4 east, 3 south). A turn left (heading becomes North): dot then 8 cells away (1 farther, not in line with this heading); wall on step 5, no self ahead; 186 free cells reachable after the turn. B stay course (heading becomes East): dot then 6 cells away (1 closer, not in line with this heading); wall on step 5, no self ahead; 186 free cells reachable after the turn. C turn right (heading becomes South): dot then 6 cells away (1 closer, not in line with this heading); wall on step 11, self hit on step 1 at body segment 13 of 39, 26 of the body lies at and beyond that point; 0 free cells reachable after the turn. DIES IMMEDIATELY. "Wall on step N" means the Nth move in that direction leaves the grid; "self hit on step N" means the Nth move hits the snake's own body. The tail cell is not counted because it moves away. A safe move can still trap the snake later; fewer reachable cells is worse. Ticks so far 482. Question: Which single move best serves the goal of growing the snake as long as possible? Options: A. turn left B. stay course C. turn right Answer with the option label only. ``` Running this in llama.cpp with the following command: bash build/bin/llama-server \ -m ~/myp/models/leinenterprises-jev/Herbert_v0.8-Q4_K_M.gguf \ --temp 1.0 \ --top_p 0.95 \ --top_k 20 \ --min_p 0.0 \ --repeat-penalty 1.0 \ --presence-penalty 0.0 \ -c 200000 \ -t 16 \ -ngl 99 \ --flash-attn on \ --host 0.0.0.0 --port 8080 \ --mmproj ~/myp/models/unsloth/qwen3.8/mmproj-F16.gguf \ --mmproj-offload \ --spec-type draft-mtp \ --spec-draft-n-max 4 \ --parallel 1 \ -kvo -ctk q8_0 -ctv q8_0 -b 1024 -ub 256 \ --chat-template-kwargs '{"reasoning_effort": "medium"}'