I generally say, “I want to make X” then I slowly work up to it. Currently I’m making a pathfinding algorithm.
I input a map with my starting point and finishing point and it has to get there. It has to know where to go back to if it goes the wrong way, when it’s allowed to stop, etc.
The next steps will be getting it to only show the finished path, then to work out the fastest path when it has multiple possible paths etc.
I generally say, “I want to make X” then I slowly work up to it. Currently I’m making a pathfinding algorithm.
I input a map with my starting point and finishing point and it has to get there. It has to know where to go back to if it goes the wrong way, when it’s allowed to stop, etc.
The next steps will be getting it to only show the finished path, then to work out the fastest path when it has multiple possible paths etc.
You may find these concepts interesting (if you don’t know them already) Recursion algorithms for graphs: https://en.wikipedia.org/wiki/Shortest-path_tree Dynamic programming: https://www.baeldung.com/cs/tabulation-vs-memoization