Problem 60638. ICFP2024 009: Lambdaman Crawler-Backfill
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.
Shown is Lambdaman4 with a best known solution is 348 U/R/D/L commands by completing the lower left before lower right. This challenge uses a Crawler-Backfill method thus optimal solutions not found but big puzzles can be completed quickly if paths are width==1 and there are no loops.
This challenge is to solve multiple Lamdaman mazes by eating all the cheese via a char path of UDLR, with a program smaller than the template. The template implements a crawler-backfill This maze has no loops but multiple cul-de-sacs. Fill smallest branch first to minimize total length. The challenge is to make a smaller crawler.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers3
Suggested Problems
-
Return a list sorted by number of occurrences
2770 Solvers
-
Find common elements in matrix rows
2628 Solvers
-
157 Solvers
-
Poker Series 01: isStraightFlush
121 Solvers
-
Find best placement for ordered dominoes (harder)
309 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!