{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-04-06T14:01:22.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2026-04-06T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":60623,"title":"ICFP2024 007: Lambdaman 1, 2, 3 Breadth Solver","description":"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.\r\nThe ICFP Language is based on Lambda Calculus.\r\nThe Lambdaman 1, 2, and 3 mazes are small matrices L at various indices,  '.' a cheese bit, # is Wall. Matrix uses Wall=0,L=1,Cheese=2. Encircling Walls are added to all mazes.\r\nThe contest goal was to write a minimal size, bytes, expression that moves L, Lambdaman, to eat each cheese bit.\r\nThe contest's best Lambdaman1, 2, and 3 solutions take 15, 26, and 40 U/R/D/L commands, respectively.\r\n\r\nThe ICFP competition is more about manual solving optimizations for each unique problem.\r\nThis challenge is to solve Lamdaman mazes 1, 2 and 3 by eating all the cheese via a char path of UDLR, with a common program smaller than the template. The template implements a breadth first search with prior state check.  Optimal length solutions are required.","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 315px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 157.5px; transform-origin: 407px 157.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 14.5px 8px; transform-origin: 14.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"https://icfpcontest2024.github.io/task.html\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003eICFP2024 contest\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 300px 8px; transform-origin: 300px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e 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.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 14.5px 8px; transform-origin: 14.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"https://icfpcontest2024.github.io/icfp.html\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003eICFP Language\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 40.5px 8px; transform-origin: 40.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e is based on \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"https://en.wikipedia.org/wiki/Lambda_calculus\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003eLambda Calculus\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 2px 8px; transform-origin: 2px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 356.5px 8px; transform-origin: 356.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe Lambdaman 1, 2, and 3 mazes are small matrices L at various indices,  '.' a cheese bit, # is Wall. Matrix uses Wall=0,L=1,Cheese=2. Encircling Walls are added to all mazes.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 357.5px 8px; transform-origin: 357.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe contest goal was to write a minimal size, bytes, expression that moves L, Lambdaman, to eat each cheese bit.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 332px 8px; transform-origin: 332px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe contest's best Lambdaman1, 2, and 3 solutions take 15, 26, and 40 U/R/D/L commands, respectively.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 8px; transform-origin: 0px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 285.5px 8px; transform-origin: 285.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe ICFP competition is more about manual solving optimizations for each unique problem.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 63px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 31.5px; text-align: left; transform-origin: 384px 31.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 379.5px 8px; transform-origin: 379.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThis challenge is to solve Lamdaman mazes 1, 2 and 3 by eating all the cheese via a char path of UDLR, with a common program smaller than the template. The template implements a breadth first search with prior state check.  Optimal length solutions are required.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function pathbest = Lambdaman_123(m)\r\n% Maze 1 solves in 15 so max states is 4^15=1.07e9\r\n% Each depth loop creates all new legal states from prior depth states\r\n% Maze 3 Fails miserably for pure breadth so key throat points checked for uneaten cheese\r\n%History of prior states maintained to eliminate duplicated states\r\n [nr,nc]=size(m);\r\n adj=[-1 1 -nr nr];\r\n bn2=nnz(m(:)==2);\r\n stateh=zeros(20000,nr*nc,'int8');\r\n spath=zeros(20000,15,'uint8');\r\n c2=nnz(m(:)==2);\r\n statec2=ones(20000,1)*c2;\r\n stateh(1,:)=m(:);\r\n sptr=1; eptr=1;\r\n enptr=eptr;\r\n depth=0;\r\n \r\n m3=nr*nc==72; % Hack for Lambdaman3\r\n \r\n while c2\u003e0\r\n  depth=depth+1;\r\n  fprintf('Depth:%i sptr:%i eptr:%i\\n',depth,sptr,eptr)\r\n  for hptr=sptr:eptr\r\n   ms=stateh(hptr,:);\r\n   \r\n   Lidx=find(ms==1);\r\n   \r\n   if m3 % Hack for Lambdaman3: Check chokepoints for completion\r\n    if Lidx==26 \u0026\u0026 nnz(ms([62 52 34])==2),continue;end %Lower grp\r\n    if Lidx==26 \u0026\u0026 ms(17)==3,continue;end % turn aroud\r\n    if Lidx==12 \u0026\u0026 nnz(ms([24 22 32 14])==2),continue;end %Left grp\r\n    if Lidx==12 \u0026\u0026 ms(11)==3,continue;end % turn aroud\r\n    if Lidx==20 \u0026\u0026 ms(29)==3,continue;end % turn aroud\r\n   end\r\n   \r\n   Cadj=ms(adj+Lidx);\r\n   msn=ms;\r\n   msn(Lidx)=3; %Lambdaman will move\r\n   for i=1:4 % UDLR\r\n    if Cadj(i)==0,continue;end % Ignore into wall Cadj==0 movement\r\n     Lidxn=Lidx+adj(i);\r\n     msn(Lidxn)=1;\r\n     \r\n     c2=nnz(msn==2);\r\n     ptr1=find(msn==2,1,'first');\r\n     ptr2=find(msn==2,1,'last');\r\n     cvec=statec2(1:enptr)==c2; % Reduce vector check only to c2 qty vectors\r\n     cvec=cvec \u0026 stateh(1:enptr,Lidxn)==1 \u0026 stateh(1:enptr,ptr1)==2 \u0026 stateh(1:enptr,ptr2)==2;\r\n     if nnz(cvec) % Perform a check\r\n      if nnz(sum(abs(stateh(cvec,:)-msn),2)==0) %23K/1.9s Pre-exist state check\r\n        msn(Lidxn)=ms(Lidxn); % Reset msn\r\n       continue; %Abort when create an existing prior state\r\n      end\r\n     end\r\n     \r\n     enptr=enptr+1; % new valid state\r\n     spath(enptr,:)=spath(hptr,:);\r\n     spath(enptr,depth)=i; % UDLR as 1 2 3 4\r\n     stateh(enptr,:)=msn;\r\n     msn(Lidxn)=ms(Lidxn); % Reset msn\r\n     statec2(enptr)=c2;\r\n          \r\n     if c2==0,break;end\r\n   end % UDLR\r\n   if c2==0\r\n    eptr=enptr;\r\n    break;\r\n   end\r\n   \r\n  end % hptr\r\n  sptr=eptr+1; % update wave\r\n  eptr=enptr;\r\n   \r\n end % while  c2\u003e0\r\n \r\n UDLR='UDLR';\r\n pathbest=UDLR(spath(eptr,1:depth));\r\n fprintf('BestPath:');fprintf('%s',pathbest);fprintf('\\n')\r\n  \r\nend %maze_breadth","test_suite":"%%\r\nvalid=0;\r\n% L lambdaman 1,   . Cheese 2,   # Wall 0\r\n\r\n%Lambdaman 1  optimal solution L15 LLLDURRRUDRRURR\r\nms=['###.#...'\r\n    '...L..##'\r\n    '.#######'];\r\n\r\n[nr,nc]=size(ms);\r\nmb=ones(nr,nc)*2; %Cheese bits are 2.\r\nmb(ms=='#')=0; % Wall\r\nmb(ms=='L')=1; % Landaman, start point\r\nm=zeros(nr+2,nc+2);\r\nm(2:end-1,2:end-1)=mb; %Wall surrounded maze\r\n[nr,nc]=size(m);\r\n\r\nfor i=1:nr % Display maze numeric\r\n fprintf('%i',m(i,:));fprintf('\\n');\r\nend\r\n\r\nztic=tic;\r\nv = Lambdaman_123(m);\r\ntoc(ztic)\r\nfprintf('Answer Length: %i\\n',length(v));\r\n\r\nmc=m==2; %Create cheese binary matrix for processing path coverage\r\n\r\n[r,c]=find(m==1); % Lambdaman\r\nfor i=1:length(v)\r\n if v(i)=='R' % R\r\n  if c+1\u003c=nc\r\n    if m(r,c+1)\u003e0\r\n     c=c+1;\r\n    end\r\n  end\r\n elseif v(i)=='L' % L\r\n  if c-1\u003e=1\r\n    if m(r,c-1)\u003e0\r\n     c=c-1;\r\n    end\r\n  end\r\n elseif v(i)=='U' % U\r\n  if r-1\u003e=1\r\n   if m(r-1,c)\u003e0\r\n     r=r-1;\r\n   end\r\n  end\r\n elseif v(i)=='D' % D\r\n  if r+1\u003c=nr\r\n    if m(r+1,c)\u003e0\r\n     r=r+1;\r\n    end\r\n  end\r\n end\r\n mc(r,c)=0; \r\n if nnz(mc)==0,break;end\r\nend\r\n\r\nif nnz(mc)==0\r\n if length(v)==15\r\n  valid=1;\r\n else\r\n  fprintf('Length 15 required. Given length:%i\\n',length(v));\r\n end\r\nelse\r\n fprintf('Failed to Clear - remaining cheesy bits\\n');\r\n for i=1:nr % Display maze numeric\r\n  fprintf('%i',mc(i,:));fprintf('\\n');\r\n end\r\nend\r\n\r\nzmap=[0 0 0;1 0 0;0 1 0;0 0 1]; % maps to 1:4\r\nfigure;image(m+1);colormap(zmap);axis equal;axis tight\r\n\r\nassert(valid)\r\n\r\n%%\r\nvalid=0;\r\n% L lambdaman 1,   . Cheese 2,   # Wall 0\r\n\r\n%Lambdaman 2  optimal solution L26 RDURRDDRRUUDDLLLDLLDDRRRUR\r\nms=['L...#.'\r\n    '#.#.#.'\r\n    '##....'\r\n    '...###'\r\n    '.##..#'\r\n    '....##'];\r\n\r\n[nr,nc]=size(ms);\r\nmb=ones(nr,nc)*2; %Cheese bits are 2.\r\nmb(ms=='#')=0; % Wall\r\nmb(ms=='L')=1; % Landaman, start point\r\nm=zeros(nr+2,nc+2);\r\nm(2:end-1,2:end-1)=mb; %Wall surrounded maze\r\n[nr,nc]=size(m);\r\n\r\nfor i=1:nr % Display maze numeric\r\n fprintf('%i',m(i,:));fprintf('\\n');\r\nend\r\n\r\nztic=tic;\r\nv = Lambdaman_123(m);\r\ntoc(ztic)\r\n\r\nfprintf('Answer Length: %i\\n',length(v));\r\n\r\nmc=m==2; %Create cheese binary matrix for processing path coverage\r\n\r\n[r,c]=find(m==1); % Lambdaman\r\nfor i=1:length(v)\r\n if v(i)=='R' % R\r\n  if c+1\u003c=nc\r\n    if m(r,c+1)\u003e0\r\n     c=c+1;\r\n    end\r\n  end\r\n elseif v(i)=='L' % L\r\n  if c-1\u003e=1\r\n    if m(r,c-1)\u003e0\r\n     c=c-1;\r\n    end\r\n  end\r\n elseif v(i)=='U' % U\r\n  if r-1\u003e=1\r\n   if m(r-1,c)\u003e0\r\n     r=r-1;\r\n   end\r\n  end\r\n elseif v(i)=='D' % D\r\n  if r+1\u003c=nr\r\n    if m(r+1,c)\u003e0\r\n     r=r+1;\r\n    end\r\n  end\r\n end\r\n mc(r,c)=0; \r\n if nnz(mc)==0,break;end\r\nend\r\n\r\nif nnz(mc)==0\r\n if length(v)==26\r\n  valid=1;\r\n else\r\n  fprintf('Length 26 required. Given length:%i\\n',length(v));\r\n end\r\nelse\r\n fprintf('Failed to Clear - remaining cheesy bits\\n');\r\n for i=1:nr % Display maze numeric\r\n  fprintf('%i',mc(i,:));fprintf('\\n');\r\n end\r\nend\r\n\r\nzmap=[0 0 0;1 0 0;0 1 0;0 0 1]; % maps to 1:4\r\nfigure;image(m+1);colormap(zmap);axis equal;axis tight\r\n\r\nassert(valid)\r\n\r\n%%\r\nvalid=0;\r\n% L lambdaman 1,   . Cheese 2,   # Wall 0\r\n\r\n%Lambdaman 3  optimal solution L40 DRDRLLLUDLLUURURLLURLUURRDRDRDRDUUUULDLU\r\nms=[  '......'\r\n      '.#....'\r\n      '..#...'\r\n      '...#..'\r\n      '..#L#.'\r\n      '.#...#'\r\n      '......'];\r\n[nr,nc]=size(ms);\r\nmb=ones(nr,nc)*2; %Cheese bits are 2.\r\nmb(ms=='#')=0; % Wall\r\nmb(ms=='L')=1; % Landaman, start point\r\nm=zeros(nr+2,nc+2);\r\nm(2:end-1,2:end-1)=mb; %Wall surrounded maze\r\n[nr,nc]=size(m);\r\n\r\nfor i=1:nr % Display maze numeric\r\n fprintf('%i',m(i,:));fprintf('\\n');\r\nend\r\nztic=tic;\r\nv = Lambdaman_123(m);\r\ntoc(ztic)\r\nfprintf('Answer Length: %i\\n',length(v));\r\n\r\nmc=m==2; %Create cheese binary matrix for processing path coverage\r\n\r\n[r,c]=find(m==1); % Lambdaman\r\nfor i=1:length(v)\r\n if v(i)=='R' % R\r\n  if c+1\u003c=nc\r\n    if m(r,c+1)\u003e0\r\n     c=c+1;\r\n    end\r\n  end\r\n elseif v(i)=='L' % L\r\n  if c-1\u003e=1\r\n    if m(r,c-1)\u003e0\r\n     c=c-1;\r\n    end\r\n  end\r\n elseif v(i)=='U' % U\r\n  if r-1\u003e=1\r\n   if m(r-1,c)\u003e0\r\n     r=r-1;\r\n   end\r\n  end\r\n elseif v(i)=='D' % D\r\n  if r+1\u003c=nr\r\n    if m(r+1,c)\u003e0\r\n     r=r+1;\r\n    end\r\n  end\r\n end\r\n mc(r,c)=0; \r\n if nnz(mc)==0,break;end\r\nend\r\n\r\nif nnz(mc)==0\r\n if length(v)==40\r\n  valid=1;\r\n else\r\n  fprintf('Length 40 required. Given length:%i\\n',length(v));\r\n end\r\nelse\r\n fprintf('Failed to Clear - remaining cheesy bits\\n');\r\n for i=1:nr % Display maze numeric\r\n  fprintf('%i',mc(i,:));fprintf('\\n');\r\n end\r\nend\r\n\r\nzmap=[0 0 0;1 0 0;0 1 0;0 0 1]; % maps to 1:4\r\nfigure;image(m+1);colormap(zmap);axis equal;axis tight\r\n\r\nassert(valid)\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":3097,"edited_by":3097,"edited_at":"2024-07-14T03:49:34.000Z","deleted_by":null,"deleted_at":null,"solvers_count":12,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2024-07-13T14:56:14.000Z","updated_at":"2025-12-08T21:14:18.000Z","published_at":"2024-07-14T03:49:34.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://icfpcontest2024.github.io/task.html\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eICFP2024 contest\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e 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.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://icfpcontest2024.github.io/icfp.html\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eICFP Language\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e is based on \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://en.wikipedia.org/wiki/Lambda_calculus\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eLambda Calculus\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe Lambdaman 1, 2, and 3 mazes are small matrices L at various indices,  '.' a cheese bit, # is Wall. Matrix uses Wall=0,L=1,Cheese=2. Encircling Walls are added to all mazes.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe contest goal was to write a minimal size, bytes, expression that moves L, Lambdaman, to eat each cheese bit.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe contest's best Lambdaman1, 2, and 3 solutions take 15, 26, and 40 U/R/D/L commands, respectively.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe ICFP competition is more about manual solving optimizations for each unique problem.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis challenge is to solve Lamdaman mazes 1, 2 and 3 by eating all the cheese via a char path of UDLR, with a common program smaller than the template. The template implements a breadth first search with prior state check.  Optimal length solutions are required.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"},{"id":60628,"title":"ICFP2024 008: Lambdaman4 Breadth Solver","description":"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.\r\nThe 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.\r\nThe contest goal was to write a minimal size, bytes, expression that moves L, Lambdaman, to eat each cheese bit.\r\nThe contest's best known Lambdaman4 solution is 348 U/R/D/L commands by completing the lower left before lower right.\r\n\r\nThis 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.","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 675px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 337.5px; transform-origin: 407px 337.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 14.5px 8px; transform-origin: 14.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"https://icfpcontest2024.github.io/task.html\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003eICFP2024 contest\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 300px 8px; transform-origin: 300px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e 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.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 317.5px 8px; transform-origin: 317.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe 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.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 357.5px 8px; transform-origin: 357.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe contest goal was to write a minimal size, bytes, expression that moves L, Lambdaman, to eat each cheese bit.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 381.5px 8px; transform-origin: 381.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe contest's best known Lambdaman4 solution is 348 U/R/D/L commands by completing the lower left before lower right.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 420px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 210px; text-align: left; transform-origin: 384px 210px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cimg class=\"imageNode\" style=\"vertical-align: middle;width: 560px;height: 420px\" src=\"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAjAAAAGkCAIAAACgjIjwAAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAB3RJTUUH6AcPAxAsptw/4gAAACR0RVh0U29mdHdhcmUATUFUTEFCLCBUaGUgTWF0aFdvcmtzLCBJbmMuPFjdGAAAACJ0RVh0Q3JlYXRpb24gVGltZQAxNC1KdWwtMjAyNCAyMDoxNjo0NMVd7i4AABjfSURBVHic7d1xaF3l/T/w01slakRCbB1RalcWzzWto9hopaUTOqv4R4t0VTuMlNr9YdN1KyrC2o1UWC2mVMlESjM2C8JSnGNzVISIS4ipAaXOlZpqbqM2CxaKmIRCRYxJfn8E8iu27nvvjfee5977epE/ck7uzf0857kn7/ucc3KeOVNTUxEAJC2VdAEAEEUCCYBACCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCBclnQB5S+dTiddApCwgYGBpEsoAQKpGDKZTNIlFEocx2XcukuqwCZHWj3r3zP7X1IJHLIDIAgCiVmpwE/NFdjkSKspCoEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBNNPBGkq6QIuNifHx+fahFx/fx4vQSAK/V4qgjzermTBCAmAIAgkAIIgkAAIgkACIAguapitwcHB06dP19bWLlu2LOlaAEqYQJqVPXv2dHV1NTY2ZjKZ6urqQ4cOVVVVJV0UQEkSSPn78MMPX3755d7e3pqamiiK1q1bd+TIkfvvvz/pugBKkkDKX01NTXt7+3QaRVG0aNGiM2fOXPKRcRxHUZTJZIpXHBCA6X2fLAmk/NXV1dXV1U1/PzQ01N3d3dzcfMlHiiKoTNP7vljKkqvsvgdnz57dvHnztm3bGhoakq4FoFQJpNk6ceLE+vXrN23a9F3DIwCy4ZDdrPT19e3YsePpp5++5557kq4FoLQJpPwNDw9v37792WefXbVq1fj4eBRFqVRq7ty5SdcFUJIEUv46OjrOnz+/devWmTVNTU0tLS0JlgRQuuZMTQV4b/eykk6nc77KLsA+Mf0E35fKm34ijuOBgYHClFJWXNQAQBAcsisLpgvLRmVupSIMVUNTBk2oVEZIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBDMh1QWijClZhnMMRPgxKO5KkIvlMFWsjuULCMkAIIgkAAIgkACIAgC6ftx/Pjxzz//POkqAEqYQPoeDA4OPvzww8ePH0+6EIASJpBma3x8/Iknnpg3b17ShQCUNoE0W88999xdd90Vx3HShQCUNoE0K+++++4777zz61//+n8/LI5jiQUVyL6fE/8Ym79z5861tLQcPHjw/3xkJpMpQj1AaKb3fZmUJYGUv3379i1evHhoaGhoaGhkZKS/v3/BggXpdDrpugBKkkDK3/z580+ePNnR0RFF0WeffdbT03PNNdcIJID8CKT87dixY+b7Rx999IEHHlizZk2C9QCUNBc1ABAEI6TvR3t7e9IlAJQ2IyQAgmCEFKRCz7ZSBnPe5CHAOWzM3AMXMEICIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCCfqClOu8bUWYhK3QU8nl/vuncmz1nMqcDa8yJ2MstAA7uiwYIQEQBIEEQBAEEgBBcA5ptkZGRv7zn/9UV1ffcccdSdcCUMIE0qz09PTs3Llz5cqVQ0NDVVVVL730Uipl0AmQD4GUv4mJiZ07d7a1tS1fvjyKorVr177xxhv33ntv0nUBlCSBlL+enp4bbrhhOo2iKHrttde+65FxHEdRlMlkilQZEIbpfZ8sOb6Uv9HR0QULFrS0tCxdunTZsmV//vOfv+uRmUxGGkEFsu/nRCDlb3BwsLOzc8mSJcePHz98+PDBgwePHj2adFEApUog5e/GG29cuHDhxo0boyhKp9N3333366+/nnRRAKXKOaT8XXvttRcuur4OYDb8Dc3f6tWrR0ZGuru7oygaGRnp7e1dt25d0kUBlCojpPxdfvnlL7zwwpNPPtne3j44OLhlyxb/GwuQN4E0K7fddtv0CAmAWXLIDoAgGCFVpLKYzSXn+Y3KotUFF+BW0tEVwwgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIL5kCpSrhPMRLnPMZPHS4QmwCYUoaQivESh5ysqgyZUKiMkAIIgkAAIgkACIAjOIc3W6dOnBwcHb7jhhoaGhqRrAShhAmlWDh069Kc//WnlypUnTpy47bbb9uzZk3RFAKVKIOVvcnJy//79r7766k033XTu3LkVK1Y0NTUZJwHkxzmkWZmamrriiiuiKLryyitTqdTXX3+ddEUApcoIKX+pVGr37t3btm1bs2ZNX1/fxo0bly5deslHxnEcRVEmkylugUDCpvd9siSQZuXYsWNXXXXV/Pnza2pqPv744y+//PKqq666+GGiCCrT9L4vlrLkkF3+urq63n///Y6Ojoceeqi9vT2KohdffDHpogBKlUDK3+joaBzHc+fOnV5cuHDh8PBwsiUBlC6BlL/Fixe//fbbn3zySRRF586dO3bs2PLly5MuCqBUOYeUv4aGhl27dj344INLlizp7+/fsGHDhg0bki4KoFTNmZoK8J7GZSWdTud8UUOufVKEW3GXwd2+y6AJ5aEMOiLHJsRxPDAwUJhSyopDdgAEQSABEATnkCiMMpjBrAhNKPSx2fIQYEdQGEZIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBDMh0R2Cj1hTB5z3gQ40XuAbCVKhxESAEEQSAAEQSABEASBlLPe3t4LF4eHh998882BgYGk6gEoDwIpNwcOHNi1a9fM4pEjR37+8593dnY2Nzf/4Q9/SLAwgFLnKrtsjY2Ntba2dnZ2VldXT6+ZmJjYvXv3X//61/r6+pGRkZ/+9Kf33XffD3/4w0TLBChVRkjZamtrq62t3bt378yat956q6ampr6+Poqi2traO++88+jRo8kVCFDajJCy1dLSkkqlenp6ZtaMjY3dfPPNM4tXX311JpO55HPjOI6i6Lt+CpSr6X2fLAmkbKVS3x5NTkxMXLgylUpNTk5e8rmiCCrT9L4vlrLkkF3+qqqqJiYmZhYnJycvu0zAA+RJIOXvuuuu++CDD2YWR0dHGxsbE6wHoKQJpPzdfvvtURRNn1U6depUX1/fihUrki4KoFQ5xJS/VCq1f//+xx9/vL6+vr+/v7W1dd68eUkXBVCq5kxNuVtvYaXT6ZwvaqjAOzS723c2bKVA5LiV4jh2M5dsOGQHQBAcsiM7eXw2r0AVuJWK0ORCD/LyeAkKwwgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIJugrC0WYXqzQLxHgPG9FoCS4gBESAEEQSAAEQSABEASBlLPe3t4LFwcHB998881///vfSdUDUB5c1JCbAwcOHD58eCaT9uzZ09XV1djYmMlkqqurDx06VFVVlWyFACVKIGVrbGystbW1s7Ozurp6es2HH3748ssv9/b21tTURFG0bt26I0eO3H///YmWCVCqHLLLVltbW21t7d69e2fW1NTUtLe3T6dRFEWLFi06c+bMJZ8bx3Ecx8WoEgiJfT8nRkjZamlpSaVSPT09M2vq6urq6uqmvx8aGuru7m5ubr7kczOZTDFKBAIzve/LpCwZIWUrlfrObXX27NnNmzdv27atoaGhmCUBlBOBNFsnTpxYv379pk2bvmt4BEA2HLKblb6+vh07djz99NP33HNP0rUAlDaBlL/h4eHt27c/++yzq1atGh8fj6IolUrNnTs36boASpJAyl9HR8f58+e3bt06s6apqamlpSXBkgBK15ypKXf3Lax0Op3zVXYV2Cd53O07wK2UaysCbEIZKMJ7KceXiON4YGAgx9eoRC5qACAIDtmVhSJMJpSrInz2L3Sry6AJUcE/+8P3yAgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIL5kCpSHjP9mHwoG4VuRRk0ITKvLt/JCAmAIAgkAIIgkAAIgkACIAgCKWe9vb0Xrzx+/Pjnn39e/GIAyoZAys2BAwd27dr1rZWDg4MPP/zw8ePHEykJoDy47DtbY2Njra2tnZ2d1dXVF64fHx9/4okn5s2bl1RhAOXBCClbbW1ttbW1e/fu/db655577q677orj+H88N47j//0AoCzZ93NihJStlpaWVCrV09Nz4cp33333nXfe+fvf//7oo4/+j+dmMpkCVweEaHrfl0lZEkjZSqW+PZo8d+5cS0vLwYMHE6kHoMwIpPzt27dv8eLFQ0NDQ0NDIyMj/f39CxYsSKfTSdcFUJIEUv7mz59/8uTJjo6OKIo+++yznp6ea665RiAB5Ecg5W/Hjh0z3z/66KMPPPDAmjVrEqwHoKS5yg6AIMyZmnJv98JKp9M5X2WXa58U4X7+ZTBlQAU2ISqLVpR+E+I4HhgYKEwpZcUICYAgOIcUpCLMwxaayvzsXwRmVsxGgO+limSEBEAQBBIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAATBfEhBMjtLIQS4VQMsKUC2UsUwQgIgCAIJgCAIJACCIJBy1tvbe+HiyMhIV1fXO++8k1Q9AOXBRQ25OXDgwOHDh2cyqaenZ+fOnStXrhwaGqqqqnrppZdSKRkPkA+BlK2xsbHW1tbOzs7q6urpNRMTEzt37mxra1u+fHkURWvXrn3jjTfuvffeRMsEKFU+zmerra2ttrZ27969M2t6enpuuOGG6TSKoui1116TRgB5M0LKVktLSyqV6unpmVkzOjq6YMGClpaWf/7zn3Pnzv3lL3/5i1/84pLPjeM4iqJMJlOkWoEwTO/7ZMkIKVsXnxwaHBzs7OxcsmTJ8ePHDx8+fPDgwaNHj17yuZlMRhpBBbLv50Qg5e/GG29cuHDhxo0boyhKp9N3333366+/nnRRAKXKIbv8XXvttRcuur4OYDb8Dc3f6tWrR0ZGuru7oygaGRnp7e1dt25d0kUBlCojpPxdfvnlL7zwwpNPPtne3j44OLhly5Y77rgj6aIAStWcqSm30i2sdDqd81nNAPtkTo6Pz7UJuf7+PF6iCAq9lcpDGWylHJsQx/HAwEBhSikrDtkBEASH7MpCHsOLChTgB/My6Dhbie+PERIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBBM0FcWApzjuTKVQUcEOBtegFs1wK1UFoyQAAiCQAIgCAIJgCAIpJz19vZeuHj69Ok333zzww8/TKoegPIgkHJz4MCBXbt2zSweOnSoqamps7Pzscce+93vfpdgYQClzlV22RobG2ttbe3s7Kyurp5eMzk5uX///ldfffWmm246d+7cihUrmpqaGhoakq0ToEQZIWWrra2ttrZ27969F66cmpq64ooroii68sorU6nU119/fcnnxnEcx3ExqgRCYt/PiRFStlpaWlKpVE9Pz8yaVCq1e/fubdu2rVmzpq+vb+PGjUuXLr3kczOZTLHKBAIyve/LpCwZIWUrlbrEtjp27NhVV101f/78mpqajz/++Msvvyx+YQDlQSDlr6ur6/333+/o6HjooYfa29ujKHrxxReTLgqgVAmk/I2OjsZxPHfu3OnFhQsXDg8PJ1sSQOkSSPlbvHjx22+//cknn0RRdO7cuWPHji1fvjzpogBKlYsa8tfQ0LBr164HH3xwyZIl/f39GzZs2LBhQ9JFAZSqOVNTAd5Kt6yk0+mcr7KrwD7J4/bJuW6lXF+iAnshKspWKoOOyLEJcRwPDAwUppSy4pAdAEFwyK4sBDg7S4Cfaoug0J/9izCOLAMB7g5kxwgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIL5kCpSBc6RQzgK/fYrwtvblEuFYYQEQBAEEgBBEEgABME5pBwMDg6ePn26trZ22bJlMyuHh4cHBgYWLFiQTqcTrA2g1AmkbO3Zs6erq6uxsTGTyVRXVx86dKiqqurIkSPPPPPMypUr33vvvfvuu2/Hjh1JlwlQsqbIwsmTJ2+55ZbR0dHpxbVr177yyivffPPNrbfeeurUqampqS+++GLp0qWffvrpxc+N4zj3Xsnxq9C/vwhfeQhwK4XWhCK8ROLvnES+chTHcTH/XpUu55CyUlNT097eXlNTM724aNGiM2fOvPXWWzU1NfX19VEU1dbW3nnnnUePHk20TIAS5pBdVurq6urq6qa/Hxoa6u7ubm5u/uijj26++eaZx1x99dWZTOaST58eJH3XT4Fylc8BkgpmhJSbs2fPbt68edu2bQ0NDRMTE6nU/9+AqVRqcnLyks/KZDLSCCqQfT8nAikHJ06cWL9+/aZNm5qbm6MoqqqqmpiYmPnp5OTkZZcZcQLkSSBlq6+vb8uWLU899dQjjzwyvea666774IMPZh4wOjra2NiYUHUAJU8gZWV4eHj79u379u1bvXr1+Pj4+Pj4xMTE7bffHkVRT09PFEWnTp3q6+tbsWJF0pUClCqHmLLS0dFx/vz5rVu3zqxpampqaWnZv3//448/Xl9f39/f39raOm/evASLBChpc6am8vvvBrKVTqdzPquZa5/keu/hAPs8j9snB7iVCv0S5bGVykCOWymO44GBgcKUUlYcsgMgCAIJgCA4hxSkQk//VR7Ti5XBViqDlyiP9xJhMEICIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkBiVuI4TrqEYqvAJkdaTVEIJACCYMbYgkun00mXACTpoYce2r17d9JVlACBBEAQHLIDIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACMJlSRdASRoZGfnkk09mFuM4vuaaaxKspzh6e3t/8pOfzCwODw8PDAwsWLCgjG/GcWGTK6HTBwcHT58+XVtbu2zZspmVldDRgRBI5OMf//jHc889V1VVNb34/PPPr1q1KtmSCu3AgQOHDx/u7e2dXjxy5MgzzzyzcuXK995777777tuxY0ey5RXCt5pc9p2+Z8+erq6uxsbGTCZTXV196NChqqqqSujogExB7h577LG//OUvSVdRJKOjo7/5zW9uvfXWVatWTa/55ptvbr311lOnTk1NTX3xxRdLly799NNPkyzx+3Zxk6fKvdNPnjx5yy23jI6OTi+uXbv2lVdeKfuODo1zSOTj5MmTP/rRj0ZGRsbHx5OupeDa2tpqa2v37t07s+att96qqampr6+Poqi2tvbOO+88evRocgV+/y5uclTunV5TU9Pe3l5TUzO9uGjRojNnzpR9R4fGITtyNjEx8d///vf3v//9yMjI2NjYz372sz179iRdVAG1tLSkUqmenp6ZNWNjYzfffPPM4tVXX53JZJIorVAubnLZd3pdXV1dXd3090NDQ93d3c3NzR999FF5d3RojJDI2dmzZ9esWfPHP/6xr6+vu7u7t7f38OHDSRdVQKnUt3eTiYmJC1emUqnJycniFlVYFze5cjr97Nmzmzdv3rZtW0NDQ9l3dGgEEjm7/vrrn3/++euvvz6Koh/84Ad33333e++9l3RRRVVVVTUxMTGzODk5edllZX6woUI6/cSJE+vXr9+0aVNzc3NUkR2dLIFEzoaGhv72t7/NLH799ddz585NsJ7iu+666z744IOZxdHR0cbGxgTrKYJK6PS+vr4tW7Y89dRTjzzyyPSaCuzoZAkkcvbVV1/t3r17cHAwiqKzZ8/+61//WrduXdJFFdXtt98eRdH0KZZTp0719fWtWLEi6aIKq+w7fXh4ePv27fv27Vu9evX4+Pj4+PjExEQFdnSyDD/JWTqd/u1vf/vggw/++Mc/PnHixK9+9asy+3+U/1Mqldq/f//jjz9eX1/f39/f2to6b968pIsqrLLv9I6OjvPnz2/dunVmTVNTU0tLS6V1dLJMYU6eJicnv/rqqyuuuOLiE+CV48svv6yoLVCxnV5pHZ0UgQRAEAQ+AEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEH4f4V9JIStPVN3AAAAAElFTkSuQmCC\" data-image-state=\"image-loaded\" width=\"560\" height=\"420\"\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 84px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 42px; text-align: left; transform-origin: 384px 42px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 372.5px 8px; transform-origin: 372.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThis 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.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function pathbest = Lambdaman4_Breadth(m)\r\n% Maze 4 Fails miserably for pure breadth so key throat points checked for uneaten cheese\r\n% Work maze 4 via smallest cul-de-sac from any multi-choice path node\r\n%History of prior states maintained to eliminate duplicated states\r\n [nr,nc]=size(m);\r\n adj=[-1 1 -nr nr];\r\n %bn2=nnz(m(:)==2);\r\n stateh=zeros(95000,nr*nc,'int8');\r\n spath=zeros(95000,15,'uint8');\r\n c2=nnz(m(:)==2);\r\n statec2=ones(95000,1)*c2;\r\n stateh(1,:)=m(:);\r\n sptr=1; eptr=1;\r\n enptr=eptr;\r\n depth=0;\r\n \r\n %m3=nr*nc==72; % Hack for Lambdaman3\r\n m4=nr*nc==21*21;\r\n \r\n tic;\r\n while c2\u003e0\r\n  depth=depth+1;\r\n  if mod(depth,5)==0\r\n   fprintf('Depth:%i sptr:%i eptr:%i  Time:%.1f\\n',depth,sptr,eptr,toc)\r\n  end\r\n  for hptr=sptr:eptr\r\n   ms=stateh(hptr,:);\r\n   \r\n   Lidx=find(ms==1);\r\n   \r\n%    if m3 % Hack for Lambdaman3: Check chokepoints for completion\r\n%     if Lidx==26 \u0026\u0026 nnz(ms([62 52 34])==2),continue;end %Lower grp\r\n%     if Lidx==26 \u0026\u0026 ms(17)==3,continue;end % turn aroud\r\n%     if Lidx==12 \u0026\u0026 nnz(ms([24 22 32 14])==2),continue;end %Left grp\r\n%     if Lidx==12 \u0026\u0026 ms(11)==3,continue;end % turn aroud\r\n%     if Lidx==20 \u0026\u0026 ms(29)==3,continue;end % turn aroud\r\n%    end\r\n   \r\n% Lambdaman4\r\n% BR first L358  5.6s\r\n% BL first L348 11.3s\r\n% based on distance back to node after filling, max dist from node?\r\n    if m4 % Hack for Lambdaman4: Check chokepoints for completion\r\n    if Lidx==152 \u0026\u0026 nnz(ms([65 107 113 195])==2),continue;end %TL\r\n    if Lidx==152 \u0026\u0026 ms(5+7*21-1)==3,continue;end % turn aroud\r\n    \r\n     %if Lidx==172 \u0026\u0026 ms(401)==2,continue;end % TR\r\n     %if Lidx==276 \u0026\u0026 ms(317)==2,continue;end % TR\r\n     %if Lidx==360 \u0026\u0026 ms(403)==2,continue;end % TR\r\n    if Lidx==172 \u0026\u0026 nnz(ms([317 401 403])==2),continue;end %TL\r\n    if Lidx==172 \u0026\u0026 ms(193)==3,continue;end %Turn around\r\n    \r\n    if (Lidx==240 || Lidx==260) \u0026\u0026 ms(197)==2,continue;end  % Force shortest first\r\n\r\n%Go BL First\r\n    if Lidx==281 \u0026\u0026 ms(27)==2,continue;end %Abort BR before BL\r\n    \r\n     if Lidx==202 \u0026\u0026 ms(157)==2,continue;end % Mid BL LU Big slow down without\r\n     if Lidx==204 \u0026\u0026 ms(245)==2,continue;end % Mid BL\r\n    if Lidx==206 \u0026\u0026 nnz(ms([27 35 41 77 83  167])==2),continue;end % BL\r\n    \r\n    if Lidx==162 \u0026\u0026 ms(167)==2,continue;end % BL\r\n    if Lidx==118 \u0026\u0026 nnz(ms([77 41 83])==2),continue;end % BL\r\n    if Lidx==54 \u0026\u0026 nnz(ms([71 115])==2),continue;end % BL L 8,4 10,6\r\n    \r\n    if Lidx==96 \u0026\u0026 ms(54)==3 \u0026\u0026 nnz(ms([27 35])==2),continue;end % Missed 6,2 or 14,2\r\n    if Lidx==204 \u0026\u0026 ms(27)==3 \u0026\u0026 nnz(ms([209 251 293])==2),continue;end % Missed 20 [10 12 14]\r\n\r\n    \r\n    if Lidx==280 \u0026\u0026 ms(323)==2,continue;end % BR\r\n      if Lidx==281 \u0026\u0026 ms(280)==3,continue;end % turn around\r\n      \r\n     if Lidx==364 \u0026\u0026 ms(405)==2,continue;end % BR\r\n       if Lidx==363 \u0026\u0026 ms(364)==3,continue;end % turn around\r\n     if Lidx==368 \u0026\u0026 ms(325)==2,continue;end % BR\r\n       if Lidx==367 \u0026\u0026 ms(368)==3,continue;end % turn around\r\n     if Lidx==388 \u0026\u0026 nnz(ms([373 371])==2),continue;end %BR\r\n     if Lidx==286 \u0026\u0026 nnz(ms([283 243])==2),continue;end % BR 10.7s\r\n        \r\n   end % BL first\r\n   \r\n   \r\n   \r\n   Cadj=ms(adj+Lidx);\r\n   msn=ms;\r\n   msn(Lidx)=3; %Lambdaman will move\r\n   for i=1:4 % UDLR\r\n    if Cadj(i)==0,continue;end % Ignore into wall Cadj==0 movement\r\n     Lidxn=Lidx+adj(i);\r\n     msn(Lidxn)=1;\r\n     \r\n     c2=nnz(msn==2);\r\n     ptr1=find(msn==2,1,'first');\r\n     ptr2=find(msn==2,1,'last');\r\n     cvec=statec2(1:enptr)==c2; % Reduce vector check only to c2 qty vectors\r\n     cvec=cvec \u0026 stateh(1:enptr,Lidxn)==1 \u0026 stateh(1:enptr,ptr1)==2 \u0026 stateh(1:enptr,ptr2)==2;\r\n     if nnz(cvec) % Perform a check\r\n      if nnz(sum(abs(stateh(cvec,:)-msn),2)==0) %23K/1.9s Pre-exist state check\r\n        msn(Lidxn)=ms(Lidxn); % Reset msn\r\n       continue; %Abort when create an existing prior state\r\n      end\r\n     end\r\n     \r\n     enptr=enptr+1; % new valid state\r\n     spath(enptr,:)=spath(hptr,:);\r\n     spath(enptr,depth)=i; % UDLR as 1 2 3 4\r\n     stateh(enptr,:)=msn;\r\n     msn(Lidxn)=ms(Lidxn); % Reset msn\r\n     statec2(enptr)=c2;\r\n          \r\n     if c2==0,break;end\r\n   end % UDLR\r\n   if c2==0\r\n    eptr=enptr;\r\n    break;\r\n   end\r\n   \r\n  end % hptr\r\n  sptr=eptr+1; % update wave\r\n  eptr=enptr;\r\n   \r\n end % while  c2\u003e0\r\n \r\n UDLR='UDLR';\r\n pathbest=UDLR(spath(eptr,1:depth));\r\n fprintf('BestPath:');fprintf('%s',pathbest);fprintf('\\n')\r\n  \r\nend","test_suite":"%%\r\nvalid=0;\r\n% L lambdaman 1,   . Cheese 2,   # Wall 0\r\n\r\n%Lambdaman 4  optimal solution L348 DDLLRRUULLUUUUDDDDLLUULLUURRLLDDRRDDRRRRRRLLUUUURRRRRRDDRRRRUURRLLDDRRLLLLLLUURRLLLLLLLLDDRRRRDDDDLLRRDDLLDDLLUUDDRRDDRRLLDDLLDDDDUUUUUULLDDDDDDLLRRUULLLLUURRUUDDLLDDDDUURRRRUUUUUULLUUUUDDRRLLDDLLUUUUUUDDDDDDDDUURRRRDDRRDDRRDDDDUURRDDUURRDDUULLLLUUUUUUUURRUURRRRLLUURRRRRRLLDDRRDDDDDDDDLLRRUULLRRUUUULLLLRRDDLLLLUUDDLLRRDDRRDDLLLLRRRRDDDDRRRRLLUURR\r\n ms=[ ...\r\n'...#.#.........#...'\r\n'.###.#.#####.###.##'\r\n'...#.#.....#.......'\r\n'##.#.#.###.########'\r\n'.#....L..#.#.......'\r\n'.#####.###.#.###.##'\r\n'.#.#...#.......#...'\r\n'.#.#######.#######.'\r\n'.#...#.#...#.#.....'\r\n'.#.###.#.###.###.#.'\r\n'.....#...#.......#.'\r\n'.###.###.###.#####.'\r\n'.#.#...#...#...#...'\r\n'##.#.#.#.#####.###.'\r\n'...#.#...#.....#...'\r\n'.###.#.#.#####.####'\r\n'.....#.#.....#.#...'\r\n'.###.#.#.#.#.#.#.##'\r\n'.#...#.#.#.#.#.....'];\r\n\r\n[nr,nc]=size(ms);\r\nmb=ones(nr,nc)*2; %Cheese bits are 2.\r\nmb(ms=='#')=0; % Wall\r\nmb(ms=='L')=1; % Landaman, start point\r\nm=zeros(nr+2,nc+2);\r\nm(2:end-1,2:end-1)=mb; %Wall surrounded maze\r\n[nr,nc]=size(m);\r\n\r\nfor i=1:nr % Display maze numeric\r\n fprintf('%i',m(i,:));fprintf('\\n');\r\nend\r\n\r\nztic=tic;\r\nv = Lambdaman4_Breadth(m);\r\n\r\nfprintf('Answer Length: %i  Time:%.2f\\n',length(v),toc(ztic));\r\nfprintf('Path:');fprintf('%s',v);fprintf('\\n')\r\n\r\nmc=m==2; %Create cheese binary matrix for processing path coverage\r\n\r\n[r,c]=find(m==1); % Lambdaman\r\nfor i=1:length(v)\r\n if v(i)=='R' % R\r\n  if c+1\u003c=nc\r\n    if m(r,c+1)\u003e0\r\n     c=c+1;\r\n    end\r\n  end\r\n elseif v(i)=='L' % L\r\n  if c-1\u003e=1\r\n    if m(r,c-1)\u003e0\r\n     c=c-1;\r\n    end\r\n  end\r\n elseif v(i)=='U' % U\r\n  if r-1\u003e=1\r\n   if m(r-1,c)\u003e0\r\n     r=r-1;\r\n   end\r\n  end\r\n elseif v(i)=='D' % D\r\n  if r+1\u003c=nr\r\n    if m(r+1,c)\u003e0\r\n     r=r+1;\r\n    end\r\n  end\r\n end\r\n mc(r,c)=0; \r\n if nnz(mc)==0,break;end\r\nend\r\n\r\nif nnz(mc)==0\r\n if length(v)\u003c=348\r\n  valid=1;\r\n else\r\n  fprintf('Length \u003c=348 required. Given length:%i\\n',length(v));\r\n end\r\nelse\r\n fprintf('Failed to Clear - remaining cheesy bits\\n');\r\n for i=1:nr % Display maze numeric\r\n  fprintf('%i',mc(i,:));fprintf('\\n');\r\n end\r\nend\r\n\r\nzmap=[0 0 0;1 0 0;0 1 0;0 0 1]; % maps to 1:4\r\nfigure;image(m+1);colormap(zmap);axis equal;axis tight\r\n\r\nassert(valid)\r\n\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":3097,"edited_by":3097,"edited_at":"2024-07-15T04:13:17.000Z","deleted_by":null,"deleted_at":null,"solvers_count":3,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2024-07-15T03:21:20.000Z","updated_at":"2024-07-15T04:13:17.000Z","published_at":"2024-07-15T04:11:11.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://icfpcontest2024.github.io/task.html\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eICFP2024 contest\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e 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.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe 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.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe contest goal was to write a minimal size, bytes, expression that moves L, Lambdaman, to eat each cheese bit.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe contest's best known Lambdaman4 solution is 348 U/R/D/L commands by completing the lower left before lower right.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:customXml w:element=\\\"image\\\"\u003e\u003cw:customXmlPr\u003e\u003cw:attr w:name=\\\"height\\\" w:val=\\\"420\\\"/\u003e\u003cw:attr w:name=\\\"width\\\" w:val=\\\"560\\\"/\u003e\u003cw:attr w:name=\\\"verticalAlign\\\" w:val=\\\"middle\\\"/\u003e\u003cw:attr w:name=\\\"altText\\\" w:val=\\\"\\\"/\u003e\u003cw:attr w:name=\\\"relationshipId\\\" w:val=\\\"rId1\\\"/\u003e\u003c/w:customXmlPr\u003e\u003c/w:customXml\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis 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.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/image\",\"target\":\"/media/image1.png\",\"relationshipId\":\"rId1\"}]},{\"partUri\":\"/media/image1.png\",\"contentType\":\"image/png\",\"content\":\"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAjAAAAGkCAIAAACgjIjwAAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAB3RJTUUH6AcPAxAsptw/4gAAACR0RVh0U29mdHdhcmUATUFUTEFCLCBUaGUgTWF0aFdvcmtzLCBJbmMuPFjdGAAAACJ0RVh0Q3JlYXRpb24gVGltZQAxNC1KdWwtMjAyNCAyMDoxNjo0NMVd7i4AABjfSURBVHic7d1xaF3l/T/w01slakRCbB1RalcWzzWto9hopaUTOqv4R4t0VTuMlNr9YdN1KyrC2o1UWC2mVMlESjM2C8JSnGNzVISIS4ipAaXOlZpqbqM2CxaKmIRCRYxJfn8E8iu27nvvjfee5977epE/ck7uzf0857kn7/ucc3KeOVNTUxEAJC2VdAEAEEUCCYBACCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCBclnQB5S+dTiddApCwgYGBpEsoAQKpGDKZTNIlFEocx2XcukuqwCZHWj3r3zP7X1IJHLIDIAgCiVmpwE/NFdjkSKspCoEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBNNPBGkq6QIuNifHx+fahFx/fx4vQSAK/V4qgjzermTBCAmAIAgkAIIgkAAIgkACIAguapitwcHB06dP19bWLlu2LOlaAEqYQJqVPXv2dHV1NTY2ZjKZ6urqQ4cOVVVVJV0UQEkSSPn78MMPX3755d7e3pqamiiK1q1bd+TIkfvvvz/pugBKkkDKX01NTXt7+3QaRVG0aNGiM2fOXPKRcRxHUZTJZIpXHBCA6X2fLAmk/NXV1dXV1U1/PzQ01N3d3dzcfMlHiiKoTNP7vljKkqvsvgdnz57dvHnztm3bGhoakq4FoFQJpNk6ceLE+vXrN23a9F3DIwCy4ZDdrPT19e3YsePpp5++5557kq4FoLQJpPwNDw9v37792WefXbVq1fj4eBRFqVRq7ty5SdcFUJIEUv46OjrOnz+/devWmTVNTU0tLS0JlgRQuuZMTQV4b/eykk6nc77KLsA+Mf0E35fKm34ijuOBgYHClFJWXNQAQBAcsisLpgvLRmVupSIMVUNTBk2oVEZIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBDMh1QWijClZhnMMRPgxKO5KkIvlMFWsjuULCMkAIIgkAAIgkACIAgC6ftx/Pjxzz//POkqAEqYQPoeDA4OPvzww8ePH0+6EIASJpBma3x8/Iknnpg3b17ShQCUNoE0W88999xdd90Vx3HShQCUNoE0K+++++4777zz61//+n8/LI5jiQUVyL6fE/8Ym79z5861tLQcPHjw/3xkJpMpQj1AaKb3fZmUJYGUv3379i1evHhoaGhoaGhkZKS/v3/BggXpdDrpugBKkkDK3/z580+ePNnR0RFF0WeffdbT03PNNdcIJID8CKT87dixY+b7Rx999IEHHlizZk2C9QCUNBc1ABAEI6TvR3t7e9IlAJQ2IyQAgmCEFKRCz7ZSBnPe5CHAOWzM3AMXMEICIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCCfqClOu8bUWYhK3QU8nl/vuncmz1nMqcDa8yJ2MstAA7uiwYIQEQBIEEQBAEEgBBcA5ptkZGRv7zn/9UV1ffcccdSdcCUMIE0qz09PTs3Llz5cqVQ0NDVVVVL730Uipl0AmQD4GUv4mJiZ07d7a1tS1fvjyKorVr177xxhv33ntv0nUBlCSBlL+enp4bbrhhOo2iKHrttde+65FxHEdRlMlkilQZEIbpfZ8sOb6Uv9HR0QULFrS0tCxdunTZsmV//vOfv+uRmUxGGkEFsu/nRCDlb3BwsLOzc8mSJcePHz98+PDBgwePHj2adFEApUog5e/GG29cuHDhxo0boyhKp9N3333366+/nnRRAKXKOaT8XXvttRcuur4OYDb8Dc3f6tWrR0ZGuru7oygaGRnp7e1dt25d0kUBlCojpPxdfvnlL7zwwpNPPtne3j44OLhlyxb/GwuQN4E0K7fddtv0CAmAWXLIDoAgGCFVpLKYzSXn+Y3KotUFF+BW0tEVwwgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIL5kCpSrhPMRLnPMZPHS4QmwCYUoaQivESh5ysqgyZUKiMkAIIgkAAIgkACIAjOIc3W6dOnBwcHb7jhhoaGhqRrAShhAmlWDh069Kc//WnlypUnTpy47bbb9uzZk3RFAKVKIOVvcnJy//79r7766k033XTu3LkVK1Y0NTUZJwHkxzmkWZmamrriiiuiKLryyitTqdTXX3+ddEUApcoIKX+pVGr37t3btm1bs2ZNX1/fxo0bly5deslHxnEcRVEmkylugUDCpvd9siSQZuXYsWNXXXXV/Pnza2pqPv744y+//PKqq666+GGiCCrT9L4vlrLkkF3+urq63n///Y6Ojoceeqi9vT2KohdffDHpogBKlUDK3+joaBzHc+fOnV5cuHDh8PBwsiUBlC6BlL/Fixe//fbbn3zySRRF586dO3bs2PLly5MuCqBUOYeUv4aGhl27dj344INLlizp7+/fsGHDhg0bki4KoFTNmZoK8J7GZSWdTud8UUOufVKEW3GXwd2+y6AJ5aEMOiLHJsRxPDAwUJhSyopDdgAEQSABEATnkCiMMpjBrAhNKPSx2fIQYEdQGEZIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBDMh0R2Cj1hTB5z3gQ40XuAbCVKhxESAEEQSAAEQSABEASBlLPe3t4LF4eHh998882BgYGk6gEoDwIpNwcOHNi1a9fM4pEjR37+8593dnY2Nzf/4Q9/SLAwgFLnKrtsjY2Ntba2dnZ2VldXT6+ZmJjYvXv3X//61/r6+pGRkZ/+9Kf33XffD3/4w0TLBChVRkjZamtrq62t3bt378yat956q6ampr6+Poqi2traO++88+jRo8kVCFDajJCy1dLSkkqlenp6ZtaMjY3dfPPNM4tXX311JpO55HPjOI6i6Lt+CpSr6X2fLAmkbKVS3x5NTkxMXLgylUpNTk5e8rmiCCrT9L4vlrLkkF3+qqqqJiYmZhYnJycvu0zAA+RJIOXvuuuu++CDD2YWR0dHGxsbE6wHoKQJpPzdfvvtURRNn1U6depUX1/fihUrki4KoFQ5xJS/VCq1f//+xx9/vL6+vr+/v7W1dd68eUkXBVCq5kxNuVtvYaXT6ZwvaqjAOzS723c2bKVA5LiV4jh2M5dsOGQHQBAcsiM7eXw2r0AVuJWK0ORCD/LyeAkKwwgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIJugrC0WYXqzQLxHgPG9FoCS4gBESAEEQSAAEQSABEASBlLPe3t4LFwcHB998881///vfSdUDUB5c1JCbAwcOHD58eCaT9uzZ09XV1djYmMlkqqurDx06VFVVlWyFACVKIGVrbGystbW1s7Ozurp6es2HH3748ssv9/b21tTURFG0bt26I0eO3H///YmWCVCqHLLLVltbW21t7d69e2fW1NTUtLe3T6dRFEWLFi06c+bMJZ8bx3Ecx8WoEgiJfT8nRkjZamlpSaVSPT09M2vq6urq6uqmvx8aGuru7m5ubr7kczOZTDFKBAIzve/LpCwZIWUrlfrObXX27NnNmzdv27atoaGhmCUBlBOBNFsnTpxYv379pk2bvmt4BEA2HLKblb6+vh07djz99NP33HNP0rUAlDaBlL/h4eHt27c/++yzq1atGh8fj6IolUrNnTs36boASpJAyl9HR8f58+e3bt06s6apqamlpSXBkgBK15ypKXf3Lax0Op3zVXYV2Cd53O07wK2UaysCbEIZKMJ7KceXiON4YGAgx9eoRC5qACAIDtmVhSJMJpSrInz2L3Sry6AJUcE/+8P3yAgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIL5kCpSHjP9mHwoG4VuRRk0ITKvLt/JCAmAIAgkAIIgkAAIgkACIAgCKWe9vb0Xrzx+/Pjnn39e/GIAyoZAys2BAwd27dr1rZWDg4MPP/zw8ePHEykJoDy47DtbY2Njra2tnZ2d1dXVF64fHx9/4okn5s2bl1RhAOXBCClbbW1ttbW1e/fu/db655577q677orj+H88N47j//0AoCzZ93NihJStlpaWVCrV09Nz4cp33333nXfe+fvf//7oo4/+j+dmMpkCVweEaHrfl0lZEkjZSqW+PZo8d+5cS0vLwYMHE6kHoMwIpPzt27dv8eLFQ0NDQ0NDIyMj/f39CxYsSKfTSdcFUJIEUv7mz59/8uTJjo6OKIo+++yznp6ea665RiAB5Ecg5W/Hjh0z3z/66KMPPPDAmjVrEqwHoKS5yg6AIMyZmnJv98JKp9M5X2WXa58U4X7+ZTBlQAU2ISqLVpR+E+I4HhgYKEwpZcUICYAgOIcUpCLMwxaayvzsXwRmVsxGgO+limSEBEAQBBIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAATBfEhBMjtLIQS4VQMsKUC2UsUwQgIgCAIJgCAIJACCIJBy1tvbe+HiyMhIV1fXO++8k1Q9AOXBRQ25OXDgwOHDh2cyqaenZ+fOnStXrhwaGqqqqnrppZdSKRkPkA+BlK2xsbHW1tbOzs7q6urpNRMTEzt37mxra1u+fHkURWvXrn3jjTfuvffeRMsEKFU+zmerra2ttrZ27969M2t6enpuuOGG6TSKoui1116TRgB5M0LKVktLSyqV6unpmVkzOjq6YMGClpaWf/7zn3Pnzv3lL3/5i1/84pLPjeM4iqJMJlOkWoEwTO/7ZMkIKVsXnxwaHBzs7OxcsmTJ8ePHDx8+fPDgwaNHj17yuZlMRhpBBbLv50Qg5e/GG29cuHDhxo0boyhKp9N3333366+/nnRRAKXKIbv8XXvttRcuur4OYDb8Dc3f6tWrR0ZGuru7oygaGRnp7e1dt25d0kUBlCojpPxdfvnlL7zwwpNPPtne3j44OLhly5Y77rgj6aIAStWcqSm30i2sdDqd81nNAPtkTo6Pz7UJuf7+PF6iCAq9lcpDGWylHJsQx/HAwEBhSikrDtkBEASH7MpCHsOLChTgB/My6Dhbie+PERIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBBM0FcWApzjuTKVQUcEOBtegFs1wK1UFoyQAAiCQAIgCAIJgCAIpJz19vZeuHj69Ok333zzww8/TKoegPIgkHJz4MCBXbt2zSweOnSoqamps7Pzscce+93vfpdgYQClzlV22RobG2ttbe3s7Kyurp5eMzk5uX///ldfffWmm246d+7cihUrmpqaGhoakq0ToEQZIWWrra2ttrZ27969F66cmpq64ooroii68sorU6nU119/fcnnxnEcx3ExqgRCYt/PiRFStlpaWlKpVE9Pz8yaVCq1e/fubdu2rVmzpq+vb+PGjUuXLr3kczOZTLHKBAIyve/LpCwZIWUrlbrEtjp27NhVV101f/78mpqajz/++Msvvyx+YQDlQSDlr6ur6/333+/o6HjooYfa29ujKHrxxReTLgqgVAmk/I2OjsZxPHfu3OnFhQsXDg8PJ1sSQOkSSPlbvHjx22+//cknn0RRdO7cuWPHji1fvjzpogBKlYsa8tfQ0LBr164HH3xwyZIl/f39GzZs2LBhQ9JFAZSqOVNTAd5Kt6yk0+mcr7KrwD7J4/bJuW6lXF+iAnshKspWKoOOyLEJcRwPDAwUppSy4pAdAEFwyK4sBDg7S4Cfaoug0J/9izCOLAMB7g5kxwgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIL5kCpSBc6RQzgK/fYrwtvblEuFYYQEQBAEEgBBEEgABME5pBwMDg6ePn26trZ22bJlMyuHh4cHBgYWLFiQTqcTrA2g1AmkbO3Zs6erq6uxsTGTyVRXVx86dKiqqurIkSPPPPPMypUr33vvvfvuu2/Hjh1JlwlQsqbIwsmTJ2+55ZbR0dHpxbVr177yyivffPPNrbfeeurUqampqS+++GLp0qWffvrpxc+N4zj3Xsnxq9C/vwhfeQhwK4XWhCK8ROLvnES+chTHcTH/XpUu55CyUlNT097eXlNTM724aNGiM2fOvPXWWzU1NfX19VEU1dbW3nnnnUePHk20TIAS5pBdVurq6urq6qa/Hxoa6u7ubm5u/uijj26++eaZx1x99dWZTOaST58eJH3XT4Fylc8BkgpmhJSbs2fPbt68edu2bQ0NDRMTE6nU/9+AqVRqcnLyks/KZDLSCCqQfT8nAikHJ06cWL9+/aZNm5qbm6MoqqqqmpiYmPnp5OTkZZcZcQLkSSBlq6+vb8uWLU899dQjjzwyvea666774IMPZh4wOjra2NiYUHUAJU8gZWV4eHj79u379u1bvXr1+Pj4+Pj4xMTE7bffHkVRT09PFEWnTp3q6+tbsWJF0pUClCqHmLLS0dFx/vz5rVu3zqxpampqaWnZv3//448/Xl9f39/f39raOm/evASLBChpc6am8vvvBrKVTqdzPquZa5/keu/hAPs8j9snB7iVCv0S5bGVykCOWymO44GBgcKUUlYcsgMgCAIJgCA4hxSkQk//VR7Ti5XBViqDlyiP9xJhMEICIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkBiVuI4TrqEYqvAJkdaTVEIJACCYMbYgkun00mXACTpoYce2r17d9JVlACBBEAQHLIDIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACMJlSRdASRoZGfnkk09mFuM4vuaaaxKspzh6e3t/8pOfzCwODw8PDAwsWLCgjG/GcWGTK6HTBwcHT58+XVtbu2zZspmVldDRgRBI5OMf//jHc889V1VVNb34/PPPr1q1KtmSCu3AgQOHDx/u7e2dXjxy5MgzzzyzcuXK995777777tuxY0ey5RXCt5pc9p2+Z8+erq6uxsbGTCZTXV196NChqqqqSujogExB7h577LG//OUvSVdRJKOjo7/5zW9uvfXWVatWTa/55ptvbr311lOnTk1NTX3xxRdLly799NNPkyzx+3Zxk6fKvdNPnjx5yy23jI6OTi+uXbv2lVdeKfuODo1zSOTj5MmTP/rRj0ZGRsbHx5OupeDa2tpqa2v37t07s+att96qqampr6+Poqi2tvbOO+88evRocgV+/y5uclTunV5TU9Pe3l5TUzO9uGjRojNnzpR9R4fGITtyNjEx8d///vf3v//9yMjI2NjYz372sz179iRdVAG1tLSkUqmenp6ZNWNjYzfffPPM4tVXX53JZJIorVAubnLZd3pdXV1dXd3090NDQ93d3c3NzR999FF5d3RojJDI2dmzZ9esWfPHP/6xr6+vu7u7t7f38OHDSRdVQKnUt3eTiYmJC1emUqnJycniFlVYFze5cjr97Nmzmzdv3rZtW0NDQ9l3dGgEEjm7/vrrn3/++euvvz6Koh/84Ad33333e++9l3RRRVVVVTUxMTGzODk5edllZX6woUI6/cSJE+vXr9+0aVNzc3NUkR2dLIFEzoaGhv72t7/NLH799ddz585NsJ7iu+666z744IOZxdHR0cbGxgTrKYJK6PS+vr4tW7Y89dRTjzzyyPSaCuzoZAkkcvbVV1/t3r17cHAwiqKzZ8/+61//WrduXdJFFdXtt98eRdH0KZZTp0719fWtWLEi6aIKq+w7fXh4ePv27fv27Vu9evX4+Pj4+PjExEQFdnSyDD/JWTqd/u1vf/vggw/++Mc/PnHixK9+9asy+3+U/1Mqldq/f//jjz9eX1/f39/f2to6b968pIsqrLLv9I6OjvPnz2/dunVmTVNTU0tLS6V1dLJMYU6eJicnv/rqqyuuuOLiE+CV48svv6yoLVCxnV5pHZ0UgQRAEAQ+AEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEH4f4V9JIStPVN3AAAAAElFTkSuQmCC\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"problem_search":{"errors":[],"problems":[{"id":60623,"title":"ICFP2024 007: Lambdaman 1, 2, 3 Breadth Solver","description":"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.\r\nThe ICFP Language is based on Lambda Calculus.\r\nThe Lambdaman 1, 2, and 3 mazes are small matrices L at various indices,  '.' a cheese bit, # is Wall. Matrix uses Wall=0,L=1,Cheese=2. Encircling Walls are added to all mazes.\r\nThe contest goal was to write a minimal size, bytes, expression that moves L, Lambdaman, to eat each cheese bit.\r\nThe contest's best Lambdaman1, 2, and 3 solutions take 15, 26, and 40 U/R/D/L commands, respectively.\r\n\r\nThe ICFP competition is more about manual solving optimizations for each unique problem.\r\nThis challenge is to solve Lamdaman mazes 1, 2 and 3 by eating all the cheese via a char path of UDLR, with a common program smaller than the template. The template implements a breadth first search with prior state check.  Optimal length solutions are required.","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 315px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 157.5px; transform-origin: 407px 157.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 14.5px 8px; transform-origin: 14.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"https://icfpcontest2024.github.io/task.html\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003eICFP2024 contest\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 300px 8px; transform-origin: 300px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e 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.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 14.5px 8px; transform-origin: 14.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"https://icfpcontest2024.github.io/icfp.html\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003eICFP Language\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 40.5px 8px; transform-origin: 40.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e is based on \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"https://en.wikipedia.org/wiki/Lambda_calculus\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003eLambda Calculus\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 2px 8px; transform-origin: 2px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 356.5px 8px; transform-origin: 356.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe Lambdaman 1, 2, and 3 mazes are small matrices L at various indices,  '.' a cheese bit, # is Wall. Matrix uses Wall=0,L=1,Cheese=2. Encircling Walls are added to all mazes.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 357.5px 8px; transform-origin: 357.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe contest goal was to write a minimal size, bytes, expression that moves L, Lambdaman, to eat each cheese bit.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 332px 8px; transform-origin: 332px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe contest's best Lambdaman1, 2, and 3 solutions take 15, 26, and 40 U/R/D/L commands, respectively.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 8px; transform-origin: 0px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 285.5px 8px; transform-origin: 285.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe ICFP competition is more about manual solving optimizations for each unique problem.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 63px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 31.5px; text-align: left; transform-origin: 384px 31.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 379.5px 8px; transform-origin: 379.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThis challenge is to solve Lamdaman mazes 1, 2 and 3 by eating all the cheese via a char path of UDLR, with a common program smaller than the template. The template implements a breadth first search with prior state check.  Optimal length solutions are required.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function pathbest = Lambdaman_123(m)\r\n% Maze 1 solves in 15 so max states is 4^15=1.07e9\r\n% Each depth loop creates all new legal states from prior depth states\r\n% Maze 3 Fails miserably for pure breadth so key throat points checked for uneaten cheese\r\n%History of prior states maintained to eliminate duplicated states\r\n [nr,nc]=size(m);\r\n adj=[-1 1 -nr nr];\r\n bn2=nnz(m(:)==2);\r\n stateh=zeros(20000,nr*nc,'int8');\r\n spath=zeros(20000,15,'uint8');\r\n c2=nnz(m(:)==2);\r\n statec2=ones(20000,1)*c2;\r\n stateh(1,:)=m(:);\r\n sptr=1; eptr=1;\r\n enptr=eptr;\r\n depth=0;\r\n \r\n m3=nr*nc==72; % Hack for Lambdaman3\r\n \r\n while c2\u003e0\r\n  depth=depth+1;\r\n  fprintf('Depth:%i sptr:%i eptr:%i\\n',depth,sptr,eptr)\r\n  for hptr=sptr:eptr\r\n   ms=stateh(hptr,:);\r\n   \r\n   Lidx=find(ms==1);\r\n   \r\n   if m3 % Hack for Lambdaman3: Check chokepoints for completion\r\n    if Lidx==26 \u0026\u0026 nnz(ms([62 52 34])==2),continue;end %Lower grp\r\n    if Lidx==26 \u0026\u0026 ms(17)==3,continue;end % turn aroud\r\n    if Lidx==12 \u0026\u0026 nnz(ms([24 22 32 14])==2),continue;end %Left grp\r\n    if Lidx==12 \u0026\u0026 ms(11)==3,continue;end % turn aroud\r\n    if Lidx==20 \u0026\u0026 ms(29)==3,continue;end % turn aroud\r\n   end\r\n   \r\n   Cadj=ms(adj+Lidx);\r\n   msn=ms;\r\n   msn(Lidx)=3; %Lambdaman will move\r\n   for i=1:4 % UDLR\r\n    if Cadj(i)==0,continue;end % Ignore into wall Cadj==0 movement\r\n     Lidxn=Lidx+adj(i);\r\n     msn(Lidxn)=1;\r\n     \r\n     c2=nnz(msn==2);\r\n     ptr1=find(msn==2,1,'first');\r\n     ptr2=find(msn==2,1,'last');\r\n     cvec=statec2(1:enptr)==c2; % Reduce vector check only to c2 qty vectors\r\n     cvec=cvec \u0026 stateh(1:enptr,Lidxn)==1 \u0026 stateh(1:enptr,ptr1)==2 \u0026 stateh(1:enptr,ptr2)==2;\r\n     if nnz(cvec) % Perform a check\r\n      if nnz(sum(abs(stateh(cvec,:)-msn),2)==0) %23K/1.9s Pre-exist state check\r\n        msn(Lidxn)=ms(Lidxn); % Reset msn\r\n       continue; %Abort when create an existing prior state\r\n      end\r\n     end\r\n     \r\n     enptr=enptr+1; % new valid state\r\n     spath(enptr,:)=spath(hptr,:);\r\n     spath(enptr,depth)=i; % UDLR as 1 2 3 4\r\n     stateh(enptr,:)=msn;\r\n     msn(Lidxn)=ms(Lidxn); % Reset msn\r\n     statec2(enptr)=c2;\r\n          \r\n     if c2==0,break;end\r\n   end % UDLR\r\n   if c2==0\r\n    eptr=enptr;\r\n    break;\r\n   end\r\n   \r\n  end % hptr\r\n  sptr=eptr+1; % update wave\r\n  eptr=enptr;\r\n   \r\n end % while  c2\u003e0\r\n \r\n UDLR='UDLR';\r\n pathbest=UDLR(spath(eptr,1:depth));\r\n fprintf('BestPath:');fprintf('%s',pathbest);fprintf('\\n')\r\n  \r\nend %maze_breadth","test_suite":"%%\r\nvalid=0;\r\n% L lambdaman 1,   . Cheese 2,   # Wall 0\r\n\r\n%Lambdaman 1  optimal solution L15 LLLDURRRUDRRURR\r\nms=['###.#...'\r\n    '...L..##'\r\n    '.#######'];\r\n\r\n[nr,nc]=size(ms);\r\nmb=ones(nr,nc)*2; %Cheese bits are 2.\r\nmb(ms=='#')=0; % Wall\r\nmb(ms=='L')=1; % Landaman, start point\r\nm=zeros(nr+2,nc+2);\r\nm(2:end-1,2:end-1)=mb; %Wall surrounded maze\r\n[nr,nc]=size(m);\r\n\r\nfor i=1:nr % Display maze numeric\r\n fprintf('%i',m(i,:));fprintf('\\n');\r\nend\r\n\r\nztic=tic;\r\nv = Lambdaman_123(m);\r\ntoc(ztic)\r\nfprintf('Answer Length: %i\\n',length(v));\r\n\r\nmc=m==2; %Create cheese binary matrix for processing path coverage\r\n\r\n[r,c]=find(m==1); % Lambdaman\r\nfor i=1:length(v)\r\n if v(i)=='R' % R\r\n  if c+1\u003c=nc\r\n    if m(r,c+1)\u003e0\r\n     c=c+1;\r\n    end\r\n  end\r\n elseif v(i)=='L' % L\r\n  if c-1\u003e=1\r\n    if m(r,c-1)\u003e0\r\n     c=c-1;\r\n    end\r\n  end\r\n elseif v(i)=='U' % U\r\n  if r-1\u003e=1\r\n   if m(r-1,c)\u003e0\r\n     r=r-1;\r\n   end\r\n  end\r\n elseif v(i)=='D' % D\r\n  if r+1\u003c=nr\r\n    if m(r+1,c)\u003e0\r\n     r=r+1;\r\n    end\r\n  end\r\n end\r\n mc(r,c)=0; \r\n if nnz(mc)==0,break;end\r\nend\r\n\r\nif nnz(mc)==0\r\n if length(v)==15\r\n  valid=1;\r\n else\r\n  fprintf('Length 15 required. Given length:%i\\n',length(v));\r\n end\r\nelse\r\n fprintf('Failed to Clear - remaining cheesy bits\\n');\r\n for i=1:nr % Display maze numeric\r\n  fprintf('%i',mc(i,:));fprintf('\\n');\r\n end\r\nend\r\n\r\nzmap=[0 0 0;1 0 0;0 1 0;0 0 1]; % maps to 1:4\r\nfigure;image(m+1);colormap(zmap);axis equal;axis tight\r\n\r\nassert(valid)\r\n\r\n%%\r\nvalid=0;\r\n% L lambdaman 1,   . Cheese 2,   # Wall 0\r\n\r\n%Lambdaman 2  optimal solution L26 RDURRDDRRUUDDLLLDLLDDRRRUR\r\nms=['L...#.'\r\n    '#.#.#.'\r\n    '##....'\r\n    '...###'\r\n    '.##..#'\r\n    '....##'];\r\n\r\n[nr,nc]=size(ms);\r\nmb=ones(nr,nc)*2; %Cheese bits are 2.\r\nmb(ms=='#')=0; % Wall\r\nmb(ms=='L')=1; % Landaman, start point\r\nm=zeros(nr+2,nc+2);\r\nm(2:end-1,2:end-1)=mb; %Wall surrounded maze\r\n[nr,nc]=size(m);\r\n\r\nfor i=1:nr % Display maze numeric\r\n fprintf('%i',m(i,:));fprintf('\\n');\r\nend\r\n\r\nztic=tic;\r\nv = Lambdaman_123(m);\r\ntoc(ztic)\r\n\r\nfprintf('Answer Length: %i\\n',length(v));\r\n\r\nmc=m==2; %Create cheese binary matrix for processing path coverage\r\n\r\n[r,c]=find(m==1); % Lambdaman\r\nfor i=1:length(v)\r\n if v(i)=='R' % R\r\n  if c+1\u003c=nc\r\n    if m(r,c+1)\u003e0\r\n     c=c+1;\r\n    end\r\n  end\r\n elseif v(i)=='L' % L\r\n  if c-1\u003e=1\r\n    if m(r,c-1)\u003e0\r\n     c=c-1;\r\n    end\r\n  end\r\n elseif v(i)=='U' % U\r\n  if r-1\u003e=1\r\n   if m(r-1,c)\u003e0\r\n     r=r-1;\r\n   end\r\n  end\r\n elseif v(i)=='D' % D\r\n  if r+1\u003c=nr\r\n    if m(r+1,c)\u003e0\r\n     r=r+1;\r\n    end\r\n  end\r\n end\r\n mc(r,c)=0; \r\n if nnz(mc)==0,break;end\r\nend\r\n\r\nif nnz(mc)==0\r\n if length(v)==26\r\n  valid=1;\r\n else\r\n  fprintf('Length 26 required. Given length:%i\\n',length(v));\r\n end\r\nelse\r\n fprintf('Failed to Clear - remaining cheesy bits\\n');\r\n for i=1:nr % Display maze numeric\r\n  fprintf('%i',mc(i,:));fprintf('\\n');\r\n end\r\nend\r\n\r\nzmap=[0 0 0;1 0 0;0 1 0;0 0 1]; % maps to 1:4\r\nfigure;image(m+1);colormap(zmap);axis equal;axis tight\r\n\r\nassert(valid)\r\n\r\n%%\r\nvalid=0;\r\n% L lambdaman 1,   . Cheese 2,   # Wall 0\r\n\r\n%Lambdaman 3  optimal solution L40 DRDRLLLUDLLUURURLLURLUURRDRDRDRDUUUULDLU\r\nms=[  '......'\r\n      '.#....'\r\n      '..#...'\r\n      '...#..'\r\n      '..#L#.'\r\n      '.#...#'\r\n      '......'];\r\n[nr,nc]=size(ms);\r\nmb=ones(nr,nc)*2; %Cheese bits are 2.\r\nmb(ms=='#')=0; % Wall\r\nmb(ms=='L')=1; % Landaman, start point\r\nm=zeros(nr+2,nc+2);\r\nm(2:end-1,2:end-1)=mb; %Wall surrounded maze\r\n[nr,nc]=size(m);\r\n\r\nfor i=1:nr % Display maze numeric\r\n fprintf('%i',m(i,:));fprintf('\\n');\r\nend\r\nztic=tic;\r\nv = Lambdaman_123(m);\r\ntoc(ztic)\r\nfprintf('Answer Length: %i\\n',length(v));\r\n\r\nmc=m==2; %Create cheese binary matrix for processing path coverage\r\n\r\n[r,c]=find(m==1); % Lambdaman\r\nfor i=1:length(v)\r\n if v(i)=='R' % R\r\n  if c+1\u003c=nc\r\n    if m(r,c+1)\u003e0\r\n     c=c+1;\r\n    end\r\n  end\r\n elseif v(i)=='L' % L\r\n  if c-1\u003e=1\r\n    if m(r,c-1)\u003e0\r\n     c=c-1;\r\n    end\r\n  end\r\n elseif v(i)=='U' % U\r\n  if r-1\u003e=1\r\n   if m(r-1,c)\u003e0\r\n     r=r-1;\r\n   end\r\n  end\r\n elseif v(i)=='D' % D\r\n  if r+1\u003c=nr\r\n    if m(r+1,c)\u003e0\r\n     r=r+1;\r\n    end\r\n  end\r\n end\r\n mc(r,c)=0; \r\n if nnz(mc)==0,break;end\r\nend\r\n\r\nif nnz(mc)==0\r\n if length(v)==40\r\n  valid=1;\r\n else\r\n  fprintf('Length 40 required. Given length:%i\\n',length(v));\r\n end\r\nelse\r\n fprintf('Failed to Clear - remaining cheesy bits\\n');\r\n for i=1:nr % Display maze numeric\r\n  fprintf('%i',mc(i,:));fprintf('\\n');\r\n end\r\nend\r\n\r\nzmap=[0 0 0;1 0 0;0 1 0;0 0 1]; % maps to 1:4\r\nfigure;image(m+1);colormap(zmap);axis equal;axis tight\r\n\r\nassert(valid)\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":3097,"edited_by":3097,"edited_at":"2024-07-14T03:49:34.000Z","deleted_by":null,"deleted_at":null,"solvers_count":12,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2024-07-13T14:56:14.000Z","updated_at":"2025-12-08T21:14:18.000Z","published_at":"2024-07-14T03:49:34.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://icfpcontest2024.github.io/task.html\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eICFP2024 contest\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e 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.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://icfpcontest2024.github.io/icfp.html\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eICFP Language\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e is based on \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://en.wikipedia.org/wiki/Lambda_calculus\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eLambda Calculus\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe Lambdaman 1, 2, and 3 mazes are small matrices L at various indices,  '.' a cheese bit, # is Wall. Matrix uses Wall=0,L=1,Cheese=2. Encircling Walls are added to all mazes.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe contest goal was to write a minimal size, bytes, expression that moves L, Lambdaman, to eat each cheese bit.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe contest's best Lambdaman1, 2, and 3 solutions take 15, 26, and 40 U/R/D/L commands, respectively.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe ICFP competition is more about manual solving optimizations for each unique problem.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis challenge is to solve Lamdaman mazes 1, 2 and 3 by eating all the cheese via a char path of UDLR, with a common program smaller than the template. The template implements a breadth first search with prior state check.  Optimal length solutions are required.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"},{"id":60628,"title":"ICFP2024 008: Lambdaman4 Breadth Solver","description":"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.\r\nThe 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.\r\nThe contest goal was to write a minimal size, bytes, expression that moves L, Lambdaman, to eat each cheese bit.\r\nThe contest's best known Lambdaman4 solution is 348 U/R/D/L commands by completing the lower left before lower right.\r\n\r\nThis 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.","description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 675px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 337.5px; transform-origin: 407px 337.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 14.5px 8px; transform-origin: 14.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe \u003c/span\u003e\u003c/span\u003e\u003ca target='_blank' href = \"https://icfpcontest2024.github.io/task.html\"\u003e\u003cspan style=\"\"\u003e\u003cspan style=\"\"\u003eICFP2024 contest\u003c/span\u003e\u003c/span\u003e\u003c/a\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 300px 8px; transform-origin: 300px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003e 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.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 317.5px 8px; transform-origin: 317.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe 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.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 357.5px 8px; transform-origin: 357.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe contest goal was to write a minimal size, bytes, expression that moves L, Lambdaman, to eat each cheese bit.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 381.5px 8px; transform-origin: 381.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThe contest's best known Lambdaman4 solution is 348 U/R/D/L commands by completing the lower left before lower right.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 420px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 210px; text-align: left; transform-origin: 384px 210px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cimg class=\"imageNode\" style=\"vertical-align: middle;width: 560px;height: 420px\" src=\"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAjAAAAGkCAIAAACgjIjwAAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAB3RJTUUH6AcPAxAsptw/4gAAACR0RVh0U29mdHdhcmUATUFUTEFCLCBUaGUgTWF0aFdvcmtzLCBJbmMuPFjdGAAAACJ0RVh0Q3JlYXRpb24gVGltZQAxNC1KdWwtMjAyNCAyMDoxNjo0NMVd7i4AABjfSURBVHic7d1xaF3l/T/w01slakRCbB1RalcWzzWto9hopaUTOqv4R4t0VTuMlNr9YdN1KyrC2o1UWC2mVMlESjM2C8JSnGNzVISIS4ipAaXOlZpqbqM2CxaKmIRCRYxJfn8E8iu27nvvjfee5977epE/ck7uzf0857kn7/ucc3KeOVNTUxEAJC2VdAEAEEUCCYBACCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCBclnQB5S+dTiddApCwgYGBpEsoAQKpGDKZTNIlFEocx2XcukuqwCZHWj3r3zP7X1IJHLIDIAgCiVmpwE/NFdjkSKspCoEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBNNPBGkq6QIuNifHx+fahFx/fx4vQSAK/V4qgjzermTBCAmAIAgkAIIgkAAIgkACIAguapitwcHB06dP19bWLlu2LOlaAEqYQJqVPXv2dHV1NTY2ZjKZ6urqQ4cOVVVVJV0UQEkSSPn78MMPX3755d7e3pqamiiK1q1bd+TIkfvvvz/pugBKkkDKX01NTXt7+3QaRVG0aNGiM2fOXPKRcRxHUZTJZIpXHBCA6X2fLAmk/NXV1dXV1U1/PzQ01N3d3dzcfMlHiiKoTNP7vljKkqvsvgdnz57dvHnztm3bGhoakq4FoFQJpNk6ceLE+vXrN23a9F3DIwCy4ZDdrPT19e3YsePpp5++5557kq4FoLQJpPwNDw9v37792WefXbVq1fj4eBRFqVRq7ty5SdcFUJIEUv46OjrOnz+/devWmTVNTU0tLS0JlgRQuuZMTQV4b/eykk6nc77KLsA+Mf0E35fKm34ijuOBgYHClFJWXNQAQBAcsisLpgvLRmVupSIMVUNTBk2oVEZIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBDMh1QWijClZhnMMRPgxKO5KkIvlMFWsjuULCMkAIIgkAAIgkACIAgC6ftx/Pjxzz//POkqAEqYQPoeDA4OPvzww8ePH0+6EIASJpBma3x8/Iknnpg3b17ShQCUNoE0W88999xdd90Vx3HShQCUNoE0K+++++4777zz61//+n8/LI5jiQUVyL6fE/8Ym79z5861tLQcPHjw/3xkJpMpQj1AaKb3fZmUJYGUv3379i1evHhoaGhoaGhkZKS/v3/BggXpdDrpugBKkkDK3/z580+ePNnR0RFF0WeffdbT03PNNdcIJID8CKT87dixY+b7Rx999IEHHlizZk2C9QCUNBc1ABAEI6TvR3t7e9IlAJQ2IyQAgmCEFKRCz7ZSBnPe5CHAOWzM3AMXMEICIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCCfqClOu8bUWYhK3QU8nl/vuncmz1nMqcDa8yJ2MstAA7uiwYIQEQBIEEQBAEEgBBcA5ptkZGRv7zn/9UV1ffcccdSdcCUMIE0qz09PTs3Llz5cqVQ0NDVVVVL730Uipl0AmQD4GUv4mJiZ07d7a1tS1fvjyKorVr177xxhv33ntv0nUBlCSBlL+enp4bbrhhOo2iKHrttde+65FxHEdRlMlkilQZEIbpfZ8sOb6Uv9HR0QULFrS0tCxdunTZsmV//vOfv+uRmUxGGkEFsu/nRCDlb3BwsLOzc8mSJcePHz98+PDBgwePHj2adFEApUog5e/GG29cuHDhxo0boyhKp9N3333366+/nnRRAKXKOaT8XXvttRcuur4OYDb8Dc3f6tWrR0ZGuru7oygaGRnp7e1dt25d0kUBlCojpPxdfvnlL7zwwpNPPtne3j44OLhlyxb/GwuQN4E0K7fddtv0CAmAWXLIDoAgGCFVpLKYzSXn+Y3KotUFF+BW0tEVwwgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIL5kCpSrhPMRLnPMZPHS4QmwCYUoaQivESh5ysqgyZUKiMkAIIgkAAIgkACIAjOIc3W6dOnBwcHb7jhhoaGhqRrAShhAmlWDh069Kc//WnlypUnTpy47bbb9uzZk3RFAKVKIOVvcnJy//79r7766k033XTu3LkVK1Y0NTUZJwHkxzmkWZmamrriiiuiKLryyitTqdTXX3+ddEUApcoIKX+pVGr37t3btm1bs2ZNX1/fxo0bly5deslHxnEcRVEmkylugUDCpvd9siSQZuXYsWNXXXXV/Pnza2pqPv744y+//PKqq666+GGiCCrT9L4vlrLkkF3+urq63n///Y6Ojoceeqi9vT2KohdffDHpogBKlUDK3+joaBzHc+fOnV5cuHDh8PBwsiUBlC6BlL/Fixe//fbbn3zySRRF586dO3bs2PLly5MuCqBUOYeUv4aGhl27dj344INLlizp7+/fsGHDhg0bki4KoFTNmZoK8J7GZSWdTud8UUOufVKEW3GXwd2+y6AJ5aEMOiLHJsRxPDAwUJhSyopDdgAEQSABEATnkCiMMpjBrAhNKPSx2fIQYEdQGEZIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBDMh0R2Cj1hTB5z3gQ40XuAbCVKhxESAEEQSAAEQSABEASBlLPe3t4LF4eHh998882BgYGk6gEoDwIpNwcOHNi1a9fM4pEjR37+8593dnY2Nzf/4Q9/SLAwgFLnKrtsjY2Ntba2dnZ2VldXT6+ZmJjYvXv3X//61/r6+pGRkZ/+9Kf33XffD3/4w0TLBChVRkjZamtrq62t3bt378yat956q6ampr6+Poqi2traO++88+jRo8kVCFDajJCy1dLSkkqlenp6ZtaMjY3dfPPNM4tXX311JpO55HPjOI6i6Lt+CpSr6X2fLAmkbKVS3x5NTkxMXLgylUpNTk5e8rmiCCrT9L4vlrLkkF3+qqqqJiYmZhYnJycvu0zAA+RJIOXvuuuu++CDD2YWR0dHGxsbE6wHoKQJpPzdfvvtURRNn1U6depUX1/fihUrki4KoFQ5xJS/VCq1f//+xx9/vL6+vr+/v7W1dd68eUkXBVCq5kxNuVtvYaXT6ZwvaqjAOzS723c2bKVA5LiV4jh2M5dsOGQHQBAcsiM7eXw2r0AVuJWK0ORCD/LyeAkKwwgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIJugrC0WYXqzQLxHgPG9FoCS4gBESAEEQSAAEQSABEASBlLPe3t4LFwcHB998881///vfSdUDUB5c1JCbAwcOHD58eCaT9uzZ09XV1djYmMlkqqurDx06VFVVlWyFACVKIGVrbGystbW1s7Ozurp6es2HH3748ssv9/b21tTURFG0bt26I0eO3H///YmWCVCqHLLLVltbW21t7d69e2fW1NTUtLe3T6dRFEWLFi06c+bMJZ8bx3Ecx8WoEgiJfT8nRkjZamlpSaVSPT09M2vq6urq6uqmvx8aGuru7m5ubr7kczOZTDFKBAIzve/LpCwZIWUrlfrObXX27NnNmzdv27atoaGhmCUBlBOBNFsnTpxYv379pk2bvmt4BEA2HLKblb6+vh07djz99NP33HNP0rUAlDaBlL/h4eHt27c/++yzq1atGh8fj6IolUrNnTs36boASpJAyl9HR8f58+e3bt06s6apqamlpSXBkgBK15ypKXf3Lax0Op3zVXYV2Cd53O07wK2UaysCbEIZKMJ7KceXiON4YGAgx9eoRC5qACAIDtmVhSJMJpSrInz2L3Sry6AJUcE/+8P3yAgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIL5kCpSHjP9mHwoG4VuRRk0ITKvLt/JCAmAIAgkAIIgkAAIgkACIAgCKWe9vb0Xrzx+/Pjnn39e/GIAyoZAys2BAwd27dr1rZWDg4MPP/zw8ePHEykJoDy47DtbY2Njra2tnZ2d1dXVF64fHx9/4okn5s2bl1RhAOXBCClbbW1ttbW1e/fu/db655577q677orj+H88N47j//0AoCzZ93NihJStlpaWVCrV09Nz4cp33333nXfe+fvf//7oo4/+j+dmMpkCVweEaHrfl0lZEkjZSqW+PZo8d+5cS0vLwYMHE6kHoMwIpPzt27dv8eLFQ0NDQ0NDIyMj/f39CxYsSKfTSdcFUJIEUv7mz59/8uTJjo6OKIo+++yznp6ea665RiAB5Ecg5W/Hjh0z3z/66KMPPPDAmjVrEqwHoKS5yg6AIMyZmnJv98JKp9M5X2WXa58U4X7+ZTBlQAU2ISqLVpR+E+I4HhgYKEwpZcUICYAgOIcUpCLMwxaayvzsXwRmVsxGgO+limSEBEAQBBIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAATBfEhBMjtLIQS4VQMsKUC2UsUwQgIgCAIJgCAIJACCIJBy1tvbe+HiyMhIV1fXO++8k1Q9AOXBRQ25OXDgwOHDh2cyqaenZ+fOnStXrhwaGqqqqnrppZdSKRkPkA+BlK2xsbHW1tbOzs7q6urpNRMTEzt37mxra1u+fHkURWvXrn3jjTfuvffeRMsEKFU+zmerra2ttrZ27969M2t6enpuuOGG6TSKoui1116TRgB5M0LKVktLSyqV6unpmVkzOjq6YMGClpaWf/7zn3Pnzv3lL3/5i1/84pLPjeM4iqJMJlOkWoEwTO/7ZMkIKVsXnxwaHBzs7OxcsmTJ8ePHDx8+fPDgwaNHj17yuZlMRhpBBbLv50Qg5e/GG29cuHDhxo0boyhKp9N3333366+/nnRRAKXKIbv8XXvttRcuur4OYDb8Dc3f6tWrR0ZGuru7oygaGRnp7e1dt25d0kUBlCojpPxdfvnlL7zwwpNPPtne3j44OLhly5Y77rgj6aIAStWcqSm30i2sdDqd81nNAPtkTo6Pz7UJuf7+PF6iCAq9lcpDGWylHJsQx/HAwEBhSikrDtkBEASH7MpCHsOLChTgB/My6Dhbie+PERIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBBM0FcWApzjuTKVQUcEOBtegFs1wK1UFoyQAAiCQAIgCAIJgCAIpJz19vZeuHj69Ok333zzww8/TKoegPIgkHJz4MCBXbt2zSweOnSoqamps7Pzscce+93vfpdgYQClzlV22RobG2ttbe3s7Kyurp5eMzk5uX///ldfffWmm246d+7cihUrmpqaGhoakq0ToEQZIWWrra2ttrZ27969F66cmpq64ooroii68sorU6nU119/fcnnxnEcx3ExqgRCYt/PiRFStlpaWlKpVE9Pz8yaVCq1e/fubdu2rVmzpq+vb+PGjUuXLr3kczOZTLHKBAIyve/LpCwZIWUrlbrEtjp27NhVV101f/78mpqajz/++Msvvyx+YQDlQSDlr6ur6/333+/o6HjooYfa29ujKHrxxReTLgqgVAmk/I2OjsZxPHfu3OnFhQsXDg8PJ1sSQOkSSPlbvHjx22+//cknn0RRdO7cuWPHji1fvjzpogBKlYsa8tfQ0LBr164HH3xwyZIl/f39GzZs2LBhQ9JFAZSqOVNTAd5Kt6yk0+mcr7KrwD7J4/bJuW6lXF+iAnshKspWKoOOyLEJcRwPDAwUppSy4pAdAEFwyK4sBDg7S4Cfaoug0J/9izCOLAMB7g5kxwgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIL5kCpSBc6RQzgK/fYrwtvblEuFYYQEQBAEEgBBEEgABME5pBwMDg6ePn26trZ22bJlMyuHh4cHBgYWLFiQTqcTrA2g1AmkbO3Zs6erq6uxsTGTyVRXVx86dKiqqurIkSPPPPPMypUr33vvvfvuu2/Hjh1JlwlQsqbIwsmTJ2+55ZbR0dHpxbVr177yyivffPPNrbfeeurUqampqS+++GLp0qWffvrpxc+N4zj3Xsnxq9C/vwhfeQhwK4XWhCK8ROLvnES+chTHcTH/XpUu55CyUlNT097eXlNTM724aNGiM2fOvPXWWzU1NfX19VEU1dbW3nnnnUePHk20TIAS5pBdVurq6urq6qa/Hxoa6u7ubm5u/uijj26++eaZx1x99dWZTOaST58eJH3XT4Fylc8BkgpmhJSbs2fPbt68edu2bQ0NDRMTE6nU/9+AqVRqcnLyks/KZDLSCCqQfT8nAikHJ06cWL9+/aZNm5qbm6MoqqqqmpiYmPnp5OTkZZcZcQLkSSBlq6+vb8uWLU899dQjjzwyvea666774IMPZh4wOjra2NiYUHUAJU8gZWV4eHj79u379u1bvXr1+Pj4+Pj4xMTE7bffHkVRT09PFEWnTp3q6+tbsWJF0pUClCqHmLLS0dFx/vz5rVu3zqxpampqaWnZv3//448/Xl9f39/f39raOm/evASLBChpc6am8vvvBrKVTqdzPquZa5/keu/hAPs8j9snB7iVCv0S5bGVykCOWymO44GBgcKUUlYcsgMgCAIJgCA4hxSkQk//VR7Ti5XBViqDlyiP9xJhMEICIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkBiVuI4TrqEYqvAJkdaTVEIJACCYMbYgkun00mXACTpoYce2r17d9JVlACBBEAQHLIDIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACMJlSRdASRoZGfnkk09mFuM4vuaaaxKspzh6e3t/8pOfzCwODw8PDAwsWLCgjG/GcWGTK6HTBwcHT58+XVtbu2zZspmVldDRgRBI5OMf//jHc889V1VVNb34/PPPr1q1KtmSCu3AgQOHDx/u7e2dXjxy5MgzzzyzcuXK995777777tuxY0ey5RXCt5pc9p2+Z8+erq6uxsbGTCZTXV196NChqqqqSujogExB7h577LG//OUvSVdRJKOjo7/5zW9uvfXWVatWTa/55ptvbr311lOnTk1NTX3xxRdLly799NNPkyzx+3Zxk6fKvdNPnjx5yy23jI6OTi+uXbv2lVdeKfuODo1zSOTj5MmTP/rRj0ZGRsbHx5OupeDa2tpqa2v37t07s+att96qqampr6+Poqi2tvbOO+88evRocgV+/y5uclTunV5TU9Pe3l5TUzO9uGjRojNnzpR9R4fGITtyNjEx8d///vf3v//9yMjI2NjYz372sz179iRdVAG1tLSkUqmenp6ZNWNjYzfffPPM4tVXX53JZJIorVAubnLZd3pdXV1dXd3090NDQ93d3c3NzR999FF5d3RojJDI2dmzZ9esWfPHP/6xr6+vu7u7t7f38OHDSRdVQKnUt3eTiYmJC1emUqnJycniFlVYFze5cjr97Nmzmzdv3rZtW0NDQ9l3dGgEEjm7/vrrn3/++euvvz6Koh/84Ad33333e++9l3RRRVVVVTUxMTGzODk5edllZX6woUI6/cSJE+vXr9+0aVNzc3NUkR2dLIFEzoaGhv72t7/NLH799ddz585NsJ7iu+666z744IOZxdHR0cbGxgTrKYJK6PS+vr4tW7Y89dRTjzzyyPSaCuzoZAkkcvbVV1/t3r17cHAwiqKzZ8/+61//WrduXdJFFdXtt98eRdH0KZZTp0719fWtWLEi6aIKq+w7fXh4ePv27fv27Vu9evX4+Pj4+PjExEQFdnSyDD/JWTqd/u1vf/vggw/++Mc/PnHixK9+9asy+3+U/1Mqldq/f//jjz9eX1/f39/f2to6b968pIsqrLLv9I6OjvPnz2/dunVmTVNTU0tLS6V1dLJMYU6eJicnv/rqqyuuuOLiE+CV48svv6yoLVCxnV5pHZ0UgQRAEAQ+AEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEH4f4V9JIStPVN3AAAAAElFTkSuQmCC\" data-image-state=\"image-loaded\" width=\"560\" height=\"420\"\u003e\u003c/div\u003e\u003cdiv style=\"block-size: 84px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 42px; text-align: left; transform-origin: 384px 42px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 372.5px 8px; transform-origin: 372.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eThis 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.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function pathbest = Lambdaman4_Breadth(m)\r\n% Maze 4 Fails miserably for pure breadth so key throat points checked for uneaten cheese\r\n% Work maze 4 via smallest cul-de-sac from any multi-choice path node\r\n%History of prior states maintained to eliminate duplicated states\r\n [nr,nc]=size(m);\r\n adj=[-1 1 -nr nr];\r\n %bn2=nnz(m(:)==2);\r\n stateh=zeros(95000,nr*nc,'int8');\r\n spath=zeros(95000,15,'uint8');\r\n c2=nnz(m(:)==2);\r\n statec2=ones(95000,1)*c2;\r\n stateh(1,:)=m(:);\r\n sptr=1; eptr=1;\r\n enptr=eptr;\r\n depth=0;\r\n \r\n %m3=nr*nc==72; % Hack for Lambdaman3\r\n m4=nr*nc==21*21;\r\n \r\n tic;\r\n while c2\u003e0\r\n  depth=depth+1;\r\n  if mod(depth,5)==0\r\n   fprintf('Depth:%i sptr:%i eptr:%i  Time:%.1f\\n',depth,sptr,eptr,toc)\r\n  end\r\n  for hptr=sptr:eptr\r\n   ms=stateh(hptr,:);\r\n   \r\n   Lidx=find(ms==1);\r\n   \r\n%    if m3 % Hack for Lambdaman3: Check chokepoints for completion\r\n%     if Lidx==26 \u0026\u0026 nnz(ms([62 52 34])==2),continue;end %Lower grp\r\n%     if Lidx==26 \u0026\u0026 ms(17)==3,continue;end % turn aroud\r\n%     if Lidx==12 \u0026\u0026 nnz(ms([24 22 32 14])==2),continue;end %Left grp\r\n%     if Lidx==12 \u0026\u0026 ms(11)==3,continue;end % turn aroud\r\n%     if Lidx==20 \u0026\u0026 ms(29)==3,continue;end % turn aroud\r\n%    end\r\n   \r\n% Lambdaman4\r\n% BR first L358  5.6s\r\n% BL first L348 11.3s\r\n% based on distance back to node after filling, max dist from node?\r\n    if m4 % Hack for Lambdaman4: Check chokepoints for completion\r\n    if Lidx==152 \u0026\u0026 nnz(ms([65 107 113 195])==2),continue;end %TL\r\n    if Lidx==152 \u0026\u0026 ms(5+7*21-1)==3,continue;end % turn aroud\r\n    \r\n     %if Lidx==172 \u0026\u0026 ms(401)==2,continue;end % TR\r\n     %if Lidx==276 \u0026\u0026 ms(317)==2,continue;end % TR\r\n     %if Lidx==360 \u0026\u0026 ms(403)==2,continue;end % TR\r\n    if Lidx==172 \u0026\u0026 nnz(ms([317 401 403])==2),continue;end %TL\r\n    if Lidx==172 \u0026\u0026 ms(193)==3,continue;end %Turn around\r\n    \r\n    if (Lidx==240 || Lidx==260) \u0026\u0026 ms(197)==2,continue;end  % Force shortest first\r\n\r\n%Go BL First\r\n    if Lidx==281 \u0026\u0026 ms(27)==2,continue;end %Abort BR before BL\r\n    \r\n     if Lidx==202 \u0026\u0026 ms(157)==2,continue;end % Mid BL LU Big slow down without\r\n     if Lidx==204 \u0026\u0026 ms(245)==2,continue;end % Mid BL\r\n    if Lidx==206 \u0026\u0026 nnz(ms([27 35 41 77 83  167])==2),continue;end % BL\r\n    \r\n    if Lidx==162 \u0026\u0026 ms(167)==2,continue;end % BL\r\n    if Lidx==118 \u0026\u0026 nnz(ms([77 41 83])==2),continue;end % BL\r\n    if Lidx==54 \u0026\u0026 nnz(ms([71 115])==2),continue;end % BL L 8,4 10,6\r\n    \r\n    if Lidx==96 \u0026\u0026 ms(54)==3 \u0026\u0026 nnz(ms([27 35])==2),continue;end % Missed 6,2 or 14,2\r\n    if Lidx==204 \u0026\u0026 ms(27)==3 \u0026\u0026 nnz(ms([209 251 293])==2),continue;end % Missed 20 [10 12 14]\r\n\r\n    \r\n    if Lidx==280 \u0026\u0026 ms(323)==2,continue;end % BR\r\n      if Lidx==281 \u0026\u0026 ms(280)==3,continue;end % turn around\r\n      \r\n     if Lidx==364 \u0026\u0026 ms(405)==2,continue;end % BR\r\n       if Lidx==363 \u0026\u0026 ms(364)==3,continue;end % turn around\r\n     if Lidx==368 \u0026\u0026 ms(325)==2,continue;end % BR\r\n       if Lidx==367 \u0026\u0026 ms(368)==3,continue;end % turn around\r\n     if Lidx==388 \u0026\u0026 nnz(ms([373 371])==2),continue;end %BR\r\n     if Lidx==286 \u0026\u0026 nnz(ms([283 243])==2),continue;end % BR 10.7s\r\n        \r\n   end % BL first\r\n   \r\n   \r\n   \r\n   Cadj=ms(adj+Lidx);\r\n   msn=ms;\r\n   msn(Lidx)=3; %Lambdaman will move\r\n   for i=1:4 % UDLR\r\n    if Cadj(i)==0,continue;end % Ignore into wall Cadj==0 movement\r\n     Lidxn=Lidx+adj(i);\r\n     msn(Lidxn)=1;\r\n     \r\n     c2=nnz(msn==2);\r\n     ptr1=find(msn==2,1,'first');\r\n     ptr2=find(msn==2,1,'last');\r\n     cvec=statec2(1:enptr)==c2; % Reduce vector check only to c2 qty vectors\r\n     cvec=cvec \u0026 stateh(1:enptr,Lidxn)==1 \u0026 stateh(1:enptr,ptr1)==2 \u0026 stateh(1:enptr,ptr2)==2;\r\n     if nnz(cvec) % Perform a check\r\n      if nnz(sum(abs(stateh(cvec,:)-msn),2)==0) %23K/1.9s Pre-exist state check\r\n        msn(Lidxn)=ms(Lidxn); % Reset msn\r\n       continue; %Abort when create an existing prior state\r\n      end\r\n     end\r\n     \r\n     enptr=enptr+1; % new valid state\r\n     spath(enptr,:)=spath(hptr,:);\r\n     spath(enptr,depth)=i; % UDLR as 1 2 3 4\r\n     stateh(enptr,:)=msn;\r\n     msn(Lidxn)=ms(Lidxn); % Reset msn\r\n     statec2(enptr)=c2;\r\n          \r\n     if c2==0,break;end\r\n   end % UDLR\r\n   if c2==0\r\n    eptr=enptr;\r\n    break;\r\n   end\r\n   \r\n  end % hptr\r\n  sptr=eptr+1; % update wave\r\n  eptr=enptr;\r\n   \r\n end % while  c2\u003e0\r\n \r\n UDLR='UDLR';\r\n pathbest=UDLR(spath(eptr,1:depth));\r\n fprintf('BestPath:');fprintf('%s',pathbest);fprintf('\\n')\r\n  \r\nend","test_suite":"%%\r\nvalid=0;\r\n% L lambdaman 1,   . Cheese 2,   # Wall 0\r\n\r\n%Lambdaman 4  optimal solution L348 DDLLRRUULLUUUUDDDDLLUULLUURRLLDDRRDDRRRRRRLLUUUURRRRRRDDRRRRUURRLLDDRRLLLLLLUURRLLLLLLLLDDRRRRDDDDLLRRDDLLDDLLUUDDRRDDRRLLDDLLDDDDUUUUUULLDDDDDDLLRRUULLLLUURRUUDDLLDDDDUURRRRUUUUUULLUUUUDDRRLLDDLLUUUUUUDDDDDDDDUURRRRDDRRDDRRDDDDUURRDDUURRDDUULLLLUUUUUUUURRUURRRRLLUURRRRRRLLDDRRDDDDDDDDLLRRUULLRRUUUULLLLRRDDLLLLUUDDLLRRDDRRDDLLLLRRRRDDDDRRRRLLUURR\r\n ms=[ ...\r\n'...#.#.........#...'\r\n'.###.#.#####.###.##'\r\n'...#.#.....#.......'\r\n'##.#.#.###.########'\r\n'.#....L..#.#.......'\r\n'.#####.###.#.###.##'\r\n'.#.#...#.......#...'\r\n'.#.#######.#######.'\r\n'.#...#.#...#.#.....'\r\n'.#.###.#.###.###.#.'\r\n'.....#...#.......#.'\r\n'.###.###.###.#####.'\r\n'.#.#...#...#...#...'\r\n'##.#.#.#.#####.###.'\r\n'...#.#...#.....#...'\r\n'.###.#.#.#####.####'\r\n'.....#.#.....#.#...'\r\n'.###.#.#.#.#.#.#.##'\r\n'.#...#.#.#.#.#.....'];\r\n\r\n[nr,nc]=size(ms);\r\nmb=ones(nr,nc)*2; %Cheese bits are 2.\r\nmb(ms=='#')=0; % Wall\r\nmb(ms=='L')=1; % Landaman, start point\r\nm=zeros(nr+2,nc+2);\r\nm(2:end-1,2:end-1)=mb; %Wall surrounded maze\r\n[nr,nc]=size(m);\r\n\r\nfor i=1:nr % Display maze numeric\r\n fprintf('%i',m(i,:));fprintf('\\n');\r\nend\r\n\r\nztic=tic;\r\nv = Lambdaman4_Breadth(m);\r\n\r\nfprintf('Answer Length: %i  Time:%.2f\\n',length(v),toc(ztic));\r\nfprintf('Path:');fprintf('%s',v);fprintf('\\n')\r\n\r\nmc=m==2; %Create cheese binary matrix for processing path coverage\r\n\r\n[r,c]=find(m==1); % Lambdaman\r\nfor i=1:length(v)\r\n if v(i)=='R' % R\r\n  if c+1\u003c=nc\r\n    if m(r,c+1)\u003e0\r\n     c=c+1;\r\n    end\r\n  end\r\n elseif v(i)=='L' % L\r\n  if c-1\u003e=1\r\n    if m(r,c-1)\u003e0\r\n     c=c-1;\r\n    end\r\n  end\r\n elseif v(i)=='U' % U\r\n  if r-1\u003e=1\r\n   if m(r-1,c)\u003e0\r\n     r=r-1;\r\n   end\r\n  end\r\n elseif v(i)=='D' % D\r\n  if r+1\u003c=nr\r\n    if m(r+1,c)\u003e0\r\n     r=r+1;\r\n    end\r\n  end\r\n end\r\n mc(r,c)=0; \r\n if nnz(mc)==0,break;end\r\nend\r\n\r\nif nnz(mc)==0\r\n if length(v)\u003c=348\r\n  valid=1;\r\n else\r\n  fprintf('Length \u003c=348 required. Given length:%i\\n',length(v));\r\n end\r\nelse\r\n fprintf('Failed to Clear - remaining cheesy bits\\n');\r\n for i=1:nr % Display maze numeric\r\n  fprintf('%i',mc(i,:));fprintf('\\n');\r\n end\r\nend\r\n\r\nzmap=[0 0 0;1 0 0;0 1 0;0 0 1]; % maps to 1:4\r\nfigure;image(m+1);colormap(zmap);axis equal;axis tight\r\n\r\nassert(valid)\r\n\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":3097,"edited_by":3097,"edited_at":"2024-07-15T04:13:17.000Z","deleted_by":null,"deleted_at":null,"solvers_count":3,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2024-07-15T03:21:20.000Z","updated_at":"2024-07-15T04:13:17.000Z","published_at":"2024-07-15T04:11:11.000Z","restored_at":null,"restored_by":null,"spam":null,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://icfpcontest2024.github.io/task.html\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eICFP2024 contest\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e 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.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe 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.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe contest goal was to write a minimal size, bytes, expression that moves L, Lambdaman, to eat each cheese bit.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe contest's best known Lambdaman4 solution is 348 U/R/D/L commands by completing the lower left before lower right.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:customXml w:element=\\\"image\\\"\u003e\u003cw:customXmlPr\u003e\u003cw:attr w:name=\\\"height\\\" w:val=\\\"420\\\"/\u003e\u003cw:attr w:name=\\\"width\\\" w:val=\\\"560\\\"/\u003e\u003cw:attr w:name=\\\"verticalAlign\\\" w:val=\\\"middle\\\"/\u003e\u003cw:attr w:name=\\\"altText\\\" w:val=\\\"\\\"/\u003e\u003cw:attr w:name=\\\"relationshipId\\\" w:val=\\\"rId1\\\"/\u003e\u003c/w:customXmlPr\u003e\u003c/w:customXml\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThis 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.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/image\",\"target\":\"/media/image1.png\",\"relationshipId\":\"rId1\"}]},{\"partUri\":\"/media/image1.png\",\"contentType\":\"image/png\",\"content\":\"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAjAAAAGkCAIAAACgjIjwAAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAB3RJTUUH6AcPAxAsptw/4gAAACR0RVh0U29mdHdhcmUATUFUTEFCLCBUaGUgTWF0aFdvcmtzLCBJbmMuPFjdGAAAACJ0RVh0Q3JlYXRpb24gVGltZQAxNC1KdWwtMjAyNCAyMDoxNjo0NMVd7i4AABjfSURBVHic7d1xaF3l/T/w01slakRCbB1RalcWzzWto9hopaUTOqv4R4t0VTuMlNr9YdN1KyrC2o1UWC2mVMlESjM2C8JSnGNzVISIS4ipAaXOlZpqbqM2CxaKmIRCRYxJfn8E8iu27nvvjfee5977epE/ck7uzf0857kn7/ucc3KeOVNTUxEAJC2VdAEAEEUCCYBACCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCBclnQB5S+dTiddApCwgYGBpEsoAQKpGDKZTNIlFEocx2XcukuqwCZHWj3r3zP7X1IJHLIDIAgCiVmpwE/NFdjkSKspCoEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBNNPBGkq6QIuNifHx+fahFx/fx4vQSAK/V4qgjzermTBCAmAIAgkAIIgkAAIgkACIAguapitwcHB06dP19bWLlu2LOlaAEqYQJqVPXv2dHV1NTY2ZjKZ6urqQ4cOVVVVJV0UQEkSSPn78MMPX3755d7e3pqamiiK1q1bd+TIkfvvvz/pugBKkkDKX01NTXt7+3QaRVG0aNGiM2fOXPKRcRxHUZTJZIpXHBCA6X2fLAmk/NXV1dXV1U1/PzQ01N3d3dzcfMlHiiKoTNP7vljKkqvsvgdnz57dvHnztm3bGhoakq4FoFQJpNk6ceLE+vXrN23a9F3DIwCy4ZDdrPT19e3YsePpp5++5557kq4FoLQJpPwNDw9v37792WefXbVq1fj4eBRFqVRq7ty5SdcFUJIEUv46OjrOnz+/devWmTVNTU0tLS0JlgRQuuZMTQV4b/eykk6nc77KLsA+Mf0E35fKm34ijuOBgYHClFJWXNQAQBAcsisLpgvLRmVupSIMVUNTBk2oVEZIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBDMh1QWijClZhnMMRPgxKO5KkIvlMFWsjuULCMkAIIgkAAIgkACIAgC6ftx/Pjxzz//POkqAEqYQPoeDA4OPvzww8ePH0+6EIASJpBma3x8/Iknnpg3b17ShQCUNoE0W88999xdd90Vx3HShQCUNoE0K+++++4777zz61//+n8/LI5jiQUVyL6fE/8Ym79z5861tLQcPHjw/3xkJpMpQj1AaKb3fZmUJYGUv3379i1evHhoaGhoaGhkZKS/v3/BggXpdDrpugBKkkDK3/z580+ePNnR0RFF0WeffdbT03PNNdcIJID8CKT87dixY+b7Rx999IEHHlizZk2C9QCUNBc1ABAEI6TvR3t7e9IlAJQ2IyQAgmCEFKRCz7ZSBnPe5CHAOWzM3AMXMEICIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCCfqClOu8bUWYhK3QU8nl/vuncmz1nMqcDa8yJ2MstAA7uiwYIQEQBIEEQBAEEgBBcA5ptkZGRv7zn/9UV1ffcccdSdcCUMIE0qz09PTs3Llz5cqVQ0NDVVVVL730Uipl0AmQD4GUv4mJiZ07d7a1tS1fvjyKorVr177xxhv33ntv0nUBlCSBlL+enp4bbrhhOo2iKHrttde+65FxHEdRlMlkilQZEIbpfZ8sOb6Uv9HR0QULFrS0tCxdunTZsmV//vOfv+uRmUxGGkEFsu/nRCDlb3BwsLOzc8mSJcePHz98+PDBgwePHj2adFEApUog5e/GG29cuHDhxo0boyhKp9N3333366+/nnRRAKXKOaT8XXvttRcuur4OYDb8Dc3f6tWrR0ZGuru7oygaGRnp7e1dt25d0kUBlCojpPxdfvnlL7zwwpNPPtne3j44OLhlyxb/GwuQN4E0K7fddtv0CAmAWXLIDoAgGCFVpLKYzSXn+Y3KotUFF+BW0tEVwwgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIL5kCpSrhPMRLnPMZPHS4QmwCYUoaQivESh5ysqgyZUKiMkAIIgkAAIgkACIAjOIc3W6dOnBwcHb7jhhoaGhqRrAShhAmlWDh069Kc//WnlypUnTpy47bbb9uzZk3RFAKVKIOVvcnJy//79r7766k033XTu3LkVK1Y0NTUZJwHkxzmkWZmamrriiiuiKLryyitTqdTXX3+ddEUApcoIKX+pVGr37t3btm1bs2ZNX1/fxo0bly5deslHxnEcRVEmkylugUDCpvd9siSQZuXYsWNXXXXV/Pnza2pqPv744y+//PKqq666+GGiCCrT9L4vlrLkkF3+urq63n///Y6Ojoceeqi9vT2KohdffDHpogBKlUDK3+joaBzHc+fOnV5cuHDh8PBwsiUBlC6BlL/Fixe//fbbn3zySRRF586dO3bs2PLly5MuCqBUOYeUv4aGhl27dj344INLlizp7+/fsGHDhg0bki4KoFTNmZoK8J7GZSWdTud8UUOufVKEW3GXwd2+y6AJ5aEMOiLHJsRxPDAwUJhSyopDdgAEQSABEATnkCiMMpjBrAhNKPSx2fIQYEdQGEZIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBDMh0R2Cj1hTB5z3gQ40XuAbCVKhxESAEEQSAAEQSABEASBlLPe3t4LF4eHh998882BgYGk6gEoDwIpNwcOHNi1a9fM4pEjR37+8593dnY2Nzf/4Q9/SLAwgFLnKrtsjY2Ntba2dnZ2VldXT6+ZmJjYvXv3X//61/r6+pGRkZ/+9Kf33XffD3/4w0TLBChVRkjZamtrq62t3bt378yat956q6ampr6+Poqi2traO++88+jRo8kVCFDajJCy1dLSkkqlenp6ZtaMjY3dfPPNM4tXX311JpO55HPjOI6i6Lt+CpSr6X2fLAmkbKVS3x5NTkxMXLgylUpNTk5e8rmiCCrT9L4vlrLkkF3+qqqqJiYmZhYnJycvu0zAA+RJIOXvuuuu++CDD2YWR0dHGxsbE6wHoKQJpPzdfvvtURRNn1U6depUX1/fihUrki4KoFQ5xJS/VCq1f//+xx9/vL6+vr+/v7W1dd68eUkXBVCq5kxNuVtvYaXT6ZwvaqjAOzS723c2bKVA5LiV4jh2M5dsOGQHQBAcsiM7eXw2r0AVuJWK0ORCD/LyeAkKwwgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIJugrC0WYXqzQLxHgPG9FoCS4gBESAEEQSAAEQSABEASBlLPe3t4LFwcHB998881///vfSdUDUB5c1JCbAwcOHD58eCaT9uzZ09XV1djYmMlkqqurDx06VFVVlWyFACVKIGVrbGystbW1s7Ozurp6es2HH3748ssv9/b21tTURFG0bt26I0eO3H///YmWCVCqHLLLVltbW21t7d69e2fW1NTUtLe3T6dRFEWLFi06c+bMJZ8bx3Ecx8WoEgiJfT8nRkjZamlpSaVSPT09M2vq6urq6uqmvx8aGuru7m5ubr7kczOZTDFKBAIzve/LpCwZIWUrlfrObXX27NnNmzdv27atoaGhmCUBlBOBNFsnTpxYv379pk2bvmt4BEA2HLKblb6+vh07djz99NP33HNP0rUAlDaBlL/h4eHt27c/++yzq1atGh8fj6IolUrNnTs36boASpJAyl9HR8f58+e3bt06s6apqamlpSXBkgBK15ypKXf3Lax0Op3zVXYV2Cd53O07wK2UaysCbEIZKMJ7KceXiON4YGAgx9eoRC5qACAIDtmVhSJMJpSrInz2L3Sry6AJUcE/+8P3yAgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIL5kCpSHjP9mHwoG4VuRRk0ITKvLt/JCAmAIAgkAIIgkAAIgkACIAgCKWe9vb0Xrzx+/Pjnn39e/GIAyoZAys2BAwd27dr1rZWDg4MPP/zw8ePHEykJoDy47DtbY2Njra2tnZ2d1dXVF64fHx9/4okn5s2bl1RhAOXBCClbbW1ttbW1e/fu/db655577q677orj+H88N47j//0AoCzZ93NihJStlpaWVCrV09Nz4cp33333nXfe+fvf//7oo4/+j+dmMpkCVweEaHrfl0lZEkjZSqW+PZo8d+5cS0vLwYMHE6kHoMwIpPzt27dv8eLFQ0NDQ0NDIyMj/f39CxYsSKfTSdcFUJIEUv7mz59/8uTJjo6OKIo+++yznp6ea665RiAB5Ecg5W/Hjh0z3z/66KMPPPDAmjVrEqwHoKS5yg6AIMyZmnJv98JKp9M5X2WXa58U4X7+ZTBlQAU2ISqLVpR+E+I4HhgYKEwpZcUICYAgOIcUpCLMwxaayvzsXwRmVsxGgO+limSEBEAQBBIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAATBfEhBMjtLIQS4VQMsKUC2UsUwQgIgCAIJgCAIJACCIJBy1tvbe+HiyMhIV1fXO++8k1Q9AOXBRQ25OXDgwOHDh2cyqaenZ+fOnStXrhwaGqqqqnrppZdSKRkPkA+BlK2xsbHW1tbOzs7q6urpNRMTEzt37mxra1u+fHkURWvXrn3jjTfuvffeRMsEKFU+zmerra2ttrZ27969M2t6enpuuOGG6TSKoui1116TRgB5M0LKVktLSyqV6unpmVkzOjq6YMGClpaWf/7zn3Pnzv3lL3/5i1/84pLPjeM4iqJMJlOkWoEwTO/7ZMkIKVsXnxwaHBzs7OxcsmTJ8ePHDx8+fPDgwaNHj17yuZlMRhpBBbLv50Qg5e/GG29cuHDhxo0boyhKp9N3333366+/nnRRAKXKIbv8XXvttRcuur4OYDb8Dc3f6tWrR0ZGuru7oygaGRnp7e1dt25d0kUBlCojpPxdfvnlL7zwwpNPPtne3j44OLhly5Y77rgj6aIAStWcqSm30i2sdDqd81nNAPtkTo6Pz7UJuf7+PF6iCAq9lcpDGWylHJsQx/HAwEBhSikrDtkBEASH7MpCHsOLChTgB/My6Dhbie+PERIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBBM0FcWApzjuTKVQUcEOBtegFs1wK1UFoyQAAiCQAIgCAIJgCAIpJz19vZeuHj69Ok333zzww8/TKoegPIgkHJz4MCBXbt2zSweOnSoqamps7Pzscce+93vfpdgYQClzlV22RobG2ttbe3s7Kyurp5eMzk5uX///ldfffWmm246d+7cihUrmpqaGhoakq0ToEQZIWWrra2ttrZ27969F66cmpq64ooroii68sorU6nU119/fcnnxnEcx3ExqgRCYt/PiRFStlpaWlKpVE9Pz8yaVCq1e/fubdu2rVmzpq+vb+PGjUuXLr3kczOZTLHKBAIyve/LpCwZIWUrlbrEtjp27NhVV101f/78mpqajz/++Msvvyx+YQDlQSDlr6ur6/333+/o6HjooYfa29ujKHrxxReTLgqgVAmk/I2OjsZxPHfu3OnFhQsXDg8PJ1sSQOkSSPlbvHjx22+//cknn0RRdO7cuWPHji1fvjzpogBKlYsa8tfQ0LBr164HH3xwyZIl/f39GzZs2LBhQ9JFAZSqOVNTAd5Kt6yk0+mcr7KrwD7J4/bJuW6lXF+iAnshKspWKoOOyLEJcRwPDAwUppSy4pAdAEFwyK4sBDg7S4Cfaoug0J/9izCOLAMB7g5kxwgJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkACIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIL5kCpSBc6RQzgK/fYrwtvblEuFYYQEQBAEEgBBEEgABME5pBwMDg6ePn26trZ22bJlMyuHh4cHBgYWLFiQTqcTrA2g1AmkbO3Zs6erq6uxsTGTyVRXVx86dKiqqurIkSPPPPPMypUr33vvvfvuu2/Hjh1JlwlQsqbIwsmTJ2+55ZbR0dHpxbVr177yyivffPPNrbfeeurUqampqS+++GLp0qWffvrpxc+N4zj3Xsnxq9C/vwhfeQhwK4XWhCK8ROLvnES+chTHcTH/XpUu55CyUlNT097eXlNTM724aNGiM2fOvPXWWzU1NfX19VEU1dbW3nnnnUePHk20TIAS5pBdVurq6urq6qa/Hxoa6u7ubm5u/uijj26++eaZx1x99dWZTOaST58eJH3XT4Fylc8BkgpmhJSbs2fPbt68edu2bQ0NDRMTE6nU/9+AqVRqcnLyks/KZDLSCCqQfT8nAikHJ06cWL9+/aZNm5qbm6MoqqqqmpiYmPnp5OTkZZcZcQLkSSBlq6+vb8uWLU899dQjjzwyvea666774IMPZh4wOjra2NiYUHUAJU8gZWV4eHj79u379u1bvXr1+Pj4+Pj4xMTE7bffHkVRT09PFEWnTp3q6+tbsWJF0pUClCqHmLLS0dFx/vz5rVu3zqxpampqaWnZv3//448/Xl9f39/f39raOm/evASLBChpc6am8vvvBrKVTqdzPquZa5/keu/hAPs8j9snB7iVCv0S5bGVykCOWymO44GBgcKUUlYcsgMgCAIJgCA4hxSkQk//VR7Ti5XBViqDlyiP9xJhMEICIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACIJAAiAIAgmAIAgkAIIgkAAIgkBiVuI4TrqEYqvAJkdaTVEIJACCYMbYgkun00mXACTpoYce2r17d9JVlACBBEAQHLIDIAgCCYAgCCQAgiCQAAiCQAIgCAIJgCAIJACCIJAACMJlSRdASRoZGfnkk09mFuM4vuaaaxKspzh6e3t/8pOfzCwODw8PDAwsWLCgjG/GcWGTK6HTBwcHT58+XVtbu2zZspmVldDRgRBI5OMf//jHc889V1VVNb34/PPPr1q1KtmSCu3AgQOHDx/u7e2dXjxy5MgzzzyzcuXK995777777tuxY0ey5RXCt5pc9p2+Z8+erq6uxsbGTCZTXV196NChqqqqSujogExB7h577LG//OUvSVdRJKOjo7/5zW9uvfXWVatWTa/55ptvbr311lOnTk1NTX3xxRdLly799NNPkyzx+3Zxk6fKvdNPnjx5yy23jI6OTi+uXbv2lVdeKfuODo1zSOTj5MmTP/rRj0ZGRsbHx5OupeDa2tpqa2v37t07s+att96qqampr6+Poqi2tvbOO+88evRocgV+/y5uclTunV5TU9Pe3l5TUzO9uGjRojNnzpR9R4fGITtyNjEx8d///vf3v//9yMjI2NjYz372sz179iRdVAG1tLSkUqmenp6ZNWNjYzfffPPM4tVXX53JZJIorVAubnLZd3pdXV1dXd3090NDQ93d3c3NzR999FF5d3RojJDI2dmzZ9esWfPHP/6xr6+vu7u7t7f38OHDSRdVQKnUt3eTiYmJC1emUqnJycniFlVYFze5cjr97Nmzmzdv3rZtW0NDQ9l3dGgEEjm7/vrrn3/++euvvz6Koh/84Ad33333e++9l3RRRVVVVTUxMTGzODk5edllZX6woUI6/cSJE+vXr9+0aVNzc3NUkR2dLIFEzoaGhv72t7/NLH799ddz585NsJ7iu+666z744IOZxdHR0cbGxgTrKYJK6PS+vr4tW7Y89dRTjzzyyPSaCuzoZAkkcvbVV1/t3r17cHAwiqKzZ8/+61//WrduXdJFFdXtt98eRdH0KZZTp0719fWtWLEi6aIKq+w7fXh4ePv27fv27Vu9evX4+Pj4+PjExEQFdnSyDD/JWTqd/u1vf/vggw/++Mc/PnHixK9+9asy+3+U/1Mqldq/f//jjz9eX1/f39/f2to6b968pIsqrLLv9I6OjvPnz2/dunVmTVNTU0tLS6V1dLJMYU6eJicnv/rqqyuuuOLiE+CV48svv6yoLVCxnV5pHZ0UgQRAEAQ+AEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEEQSAAEQSABEASBBEAQBBIAQRBIAARBIAEQBIEEQBAEEgBBEEgABEEgARAEgQRAEAQSAEH4f4V9JIStPVN3AAAAAElFTkSuQmCC\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"}],"term":"tag:\"breadth solver\"","current_player_id":null,"fields":[{"name":"page","type":"integer","callback":null,"default":1,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"per_page","type":"integer","callback":null,"default":50,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"sort","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"body","type":"text","callback":null,"default":"*:*","directive":null,"facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":false},{"name":"group","type":"string","callback":null,"default":null,"directive":"group","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"difficulty_rating_bin","type":"string","callback":null,"default":null,"directive":"difficulty_rating_bin","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"id","type":"integer","callback":null,"default":null,"directive":"id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"tag","type":"string","callback":null,"default":null,"directive":"tag","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"product","type":"string","callback":null,"default":null,"directive":"product","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_at","type":"timeframe","callback":{},"default":null,"directive":"created_at","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"profile_id","type":"integer","callback":null,"default":null,"directive":"author_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_by","type":"string","callback":null,"default":null,"directive":"author","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player_id","type":"integer","callback":null,"default":null,"directive":"solver_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player","type":"string","callback":null,"default":null,"directive":"solver","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"solvers_count","type":"integer","callback":null,"default":null,"directive":"solvers_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"comments_count","type":"integer","callback":null,"default":null,"directive":"comments_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"likes_count","type":"integer","callback":null,"default":null,"directive":"likes_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leader_id","type":"integer","callback":null,"default":null,"directive":"leader_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leading_solution","type":"integer","callback":null,"default":null,"directive":"leading_solution","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true}],"filters":[{"name":"asset_type","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":"\"cody:problem\"","prepend":true},{"name":"profile_id","type":"integer","callback":{},"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":"author_id","static":null,"prepend":true}],"query":{"params":{"per_page":50,"term":"tag:\"breadth solver\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"breadth solver\"","","\"","breadth solver","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007faf50a81d60\u003e":null,"#\u003cMathWorks::Search::Field:0x00007faf50a81cc0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007faf50a81400\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007faf50a81fe0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007faf50a81f40\u003e":50,"#\u003cMathWorks::Search::Field:0x00007faf50a81ea0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007faf50a81e00\u003e":"tag:\"breadth solver\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007faf50a81e00\u003e":"tag:\"breadth solver\""},"queried_facets":{}},"query_backend":{"connection":{"configuration":{"index_url":"http://index-op-v2/solr/","query_url":"http://search-op-v2/solr/","direct_access_index_urls":["http://index-op-v2/solr/"],"direct_access_query_urls":["http://search-op-v2/solr/"],"timeout":10,"vhost":"search","exchange":"search.topic","heartbeat":30,"pre_index_mode":false,"host":"rabbitmq-eks","port":5672,"username":"cody-search","password":"78X075ddcV44","virtual_host":"search","indexer":"amqp","http_logging":"true","core":"cody"},"query_connection":{"uri":"http://search-op-v2/solr/cody/","proxy":null,"connection":{"parallel_manager":null,"headers":{"User-Agent":"Faraday v1.0.1"},"params":{},"options":{"params_encoder":"Faraday::FlatParamsEncoder","proxy":null,"bind":null,"timeout":null,"open_timeout":null,"read_timeout":null,"write_timeout":null,"boundary":null,"oauth":null,"context":null,"on_data":null},"ssl":{"verify":true,"ca_file":null,"ca_path":null,"verify_mode":null,"cert_store":null,"client_cert":null,"client_key":null,"certificate":null,"private_key":null,"verify_depth":null,"version":null,"min_version":null,"max_version":null},"default_parallel_manager":null,"builder":{"adapter":{"name":"Faraday::Adapter::NetHttp","args":[],"block":null},"handlers":[{"name":"Faraday::Response::RaiseError","args":[],"block":null}],"app":{"app":{"ssl_cert_store":{"verify_callback":null,"error":null,"error_string":null,"chain":null,"time":null},"app":{},"connection_options":{},"config_block":null}}},"url_prefix":"http://search-op-v2/solr/cody/","manual_proxy":false,"proxy":null},"update_format":"RSolr::JSON::Generator","update_path":"update","options":{"url":"http://search-op-v2/solr/cody"}}},"query":{"params":{"per_page":50,"term":"tag:\"breadth solver\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"breadth solver\"","","\"","breadth solver","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007faf50a81d60\u003e":null,"#\u003cMathWorks::Search::Field:0x00007faf50a81cc0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007faf50a81400\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007faf50a81fe0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007faf50a81f40\u003e":50,"#\u003cMathWorks::Search::Field:0x00007faf50a81ea0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007faf50a81e00\u003e":"tag:\"breadth solver\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007faf50a81e00\u003e":"tag:\"breadth solver\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":60623,"difficulty_rating":"easy-medium"},{"id":60628,"difficulty_rating":"easy-medium"}]}}