Day 10: Hoof It
Megathread guidelines
- Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
- You can send code in code blocks by using three backticks, the code, and then three backticks or use something such as https://topaz.github.io/paste/ if you prefer sending it through a URL
FAQ
- What is this?: Here is a post with a large amount of details: https://programming.dev/post/6637268
- Where do I participate?: https://adventofcode.com/
- Is there a leaderboard for the community?: We have a programming.dev leaderboard with the info on how to join in this post: https://programming.dev/post/6631465
You are viewing a single thread.
View all comments 
3 points
*
Uiua
Uiua has a very helpful path function built in which returns all valid paths that match your criteria (using diijkstra/a* depending on whether third function is provided), making a lot of path-finding stuff almost painfully simple, as you just need to provide a starting node and three functions: return next nodes, return confirmation if weâve reached a suitable target node (here testing if itâs = 9), (optional) return heuristic cost to destination (here set to constant 1), .
Data â ââĄââžâ @\n"89010123\n78121874\n87430965\n96549874\n45678903\n32019012\n01329801\n10456732"
Nâ â âĄ+[0_1 1_0 0_ÂŻ1 ÂŻ1_0]€
Ns â âœ:â(=1-:â©(âŹ0âĄ:Data))âœâžâĄ(/Ăâ„0)Nâ. # Valid, in-bounds neighbours.
Count! â /+âĄ(⧻^0ââ path(Ns|(=9âĄ:Data)|1))â=0Data
&p Count!(âŽâĄââŁ)
&p Count!â
