aoc2023-rs VS aoc2023

See : https://github.com/happyhacks/aoc2023-rs/blob/master/day10b/src/main.rs#L153

part1 : simple implementation - use a hashset to lookup between (x, y) for each pair of points and add to manhattan distance https://github.com/happyhacks/aoc2023-rs/blob/master/day11a/src/main.rs

common: implement neighbours using directions and character behaviour part 1: simple iterative bfs : https://github.com/happyhacks/aoc2023-rs/blob/master/day10a/src/main.rs

Also I did finish an optimized version which ran in about a millisecond - see

I eventually tend to do all days in Tailspin. The ones I have done so far are in directories ending in "tt" (the others are in Pyret, just to get a feel for it) https://github.com/tobega/aoc2023/tree/main

As a general tip, it is often helpful to first try to think of how you would like to represent the data in your program. Then you need to parse the data into that structure. I'd recommend you to look at a PEG-parser, for example. Or if you like, look at my Tailspin programming language which has a very visual parser syntax and also very visual ways of creating data structures (if that should happen to be your mental affinity). Look at my day1 for example. Or if you're more mathematical, maybe a functional language (I also did day1 in Pyret)