Problem 60628. ICFP2024 008: Lambdaman4 Breadth Solver
The ICFP2024 contest was held June29 thru July 1. The contest consisted of five parts: ICFP Language, Lambdaman maze, Starship flying, 3D - graph programming, and Efficiency - processing complex ICFP message to a numerical value.
The Lambdaman 4 maze is medium size,21x21, L near top left, '.' a cheese bit, # is Wall. Matrix uses Wall=0,L=1,Cheese=2. Encircling Walls are added to all mazes.
The contest goal was to write a minimal size, bytes, expression that moves L, Lambdaman, to eat each cheese bit.
The contest's best known Lambdaman4 solution is 348 U/R/D/L commands by completing the lower left before lower right.
This challenge is to solve Lamdaman maze 4 by eating all the cheese via a char path of UDLR, with a program smaller than the template. The template implements a breadth first search with prior state check and a Hack specifically for Maze 4. Known suspected Optimal length solution of 348 or better required. This maze has no loops but multiple cul-de-sacs. Fill smallest branch first to minimize total length.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers3
Suggested Problems
-
1265 Solvers
-
1354 Solvers
-
Flag largest magnitude swings as they occur
678 Solvers
-
359 Solvers
-
Getting the indices from a matrix
635 Solvers
More from this Author308
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!