Hacker News: Farer

New comment by Farer in "Pathfinding"

Farer — Fri, 16 May 2025 02:16:16 +0000

So interesting !

I made custom pathfinding solution before. How about considering my project too ?

https://github.com/Farer/bw_path_finding

New comment by Farer in "Apple's AI isn't a letdown. AI is the letdown"

Farer — Mon, 31 Mar 2025 03:10:08 +0000

I really dislike extreme views. 0 or 1. This is a concept that only fits the Digital world. The world we live in is analog. Although we call the world we live in a 'Digital World,' in reality, the 'Digit' itself is simply recorded on a certain analog machine.

Just because the 'AI' services we use today cause certain levels of error doesn't mean we can disregard their value as zero. Are Apple’s services flawless? (Vision Pro... I won’t say more.) Since humans are not perfect, everything created by humans can never be perfect. Between 0 and 1, there are countless values like 0.1, 0.0002, etc. Ignoring this concept is something I personally find truly repulsive.

When the so-called 'AI' industry was booming, Apple was completely fumbling. Why? Because Apple is not perfect either. After all, Apple is run by people.

New comment by Farer in "Stop Using and Recommending React"

Farer — Wed, 19 Mar 2025 04:31:08 +0000

"The end of tuning is stock."

https://news.ycombinator.com/item?id=41910736

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Thu, 09 Jan 2025 01:34:08 +0000

Yes, I was a huge fan of Ultima 7, 9 and Online. I remember that incredible sense of freedom gave me a kind of liberation(?). It’s an honor to be able to have this conversation with you. Thinking about how you were already grappling with pathfinding issues and addressing them in real-time back then makes me feel a bit envious. I’m sure there weren’t many people who could have had such experiences at that time. It’s thanks to people like you with those experiences that today’s programming languages and skills have developed as they have. My technical level is far below yours, but I want to complete a lightweight pathfinding algorithm for my project, no matter what. Thank you for sharing such an inspiring story.

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 13:19:38 +0000

Oh, thank you. I'll have to take a look at the source code as well.

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 13:15:00 +0000

Oh~ This is very similar to the concept I was thinking of. I don't really like the idea of exploring strictly in a clockwise direction, though. Thank you for the information!

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 09:58:02 +0000

I’ve reviewed the source code. It seems like starting with clear and accurate information about the obstacles could be an issue. Also, if the obstacles become very large, preprocessing will likely be necessary.

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 04:40:26 +0000

Oh, I saw that blog too. It helped me a lot to be inspired. What I mean by "performance" is that I want to minimize preprocessing, and I want to minimize the amount of computation I can do even when I'm navigating in real time. I'll definitely watch the video you gave me. Thank you!

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 03:57:09 +0000

Yeah, I thought about that too, but I'm also trying to keep pre-processing work as light as possible.

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 03:54:19 +0000

The algorithm for finding detour points is as follows. In fact, I’ve improved it a bit through research:

1. Detect a collision with an obstacle on the straight path connecting the starting point and the destination. 2. Decide which direction to explore along the obstacle's outline (for now, the side closer to the destination). 3. If the end of the visible outline is reached, search for an appropriate detour point around that outline. 4. Select a detour point where a straight-line movement from the starting point avoids the obstacle, preferably closer to the destination.

---

If the first detour point selection fails, I plan to search in the *opposite direction* along the outline where the obstacle was first encountered. I’m currently working on resolving this part.

You can check out my progress here: https://github.com/Farer/bw_path_finding

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 03:49:27 +0000

Oh~ That’s awesome! I’ll start analyzing the source code! Thank you!

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 03:46:53 +0000

Oh! That’s exactly correct! It seems I didn’t explain it clearly enough.

As you mentioned, *"the goal is to find a decently short path, not necessarily the shortest one."* That’s absolutely right. The basic idea is that when an obstacle is encountered, *I just need to find the first detour point.* After that, the process can be repeated from that detour point in the same way.

The link you provided is also very intriguing. I’ll take a closer look and provide feedback again afterward!

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 03:43:45 +0000

Thank you so much for providing an example related to the project!

The example you mentioned might need to be delegated to the wolf’s *lifestyle logic*. For more thoughts on this, it would be great if you could check out the link below: https://blog.breathingworld.com/concept-meeting-for-wolf-dev...

In conclusion, the wolf will, of course, have intelligence and will also possess skills for hunting. With those capabilities, the wolf will likely be able to track the traces left by the rabbit and ultimately find it.

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 03:40:07 +0000

Yes, I’m also trying to explore as many options as possible. However, I do have a strong desire to minimize preprocessing as much as I can.

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 03:38:22 +0000

Oh, as expected, A* couldn't be fully utilized on older hardware. I can totally relate, as I’m running my server on a Mini PC with an *N100 CPU* right now.

Hearing stories about the challenges and solutions for low-spec hardware like this is incredibly fascinating.

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 03:35:18 +0000

A* and JPS seem a bit different from the direction I’m aiming for.

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 03:34:30 +0000

Wow~ You’re one of the developers of Ultima, a game I truly loved! The concept of using "highways" is really fascinating!

However, in my project, everything is in plain view for everyone to observe, so I won’t be able to use any cheats like that!

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 03:32:17 +0000

Oh~ This is definitely worth referencing as well. Thank you for the information!

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 03:24:29 +0000

Oh! This seems like something even AIs haven’t suggested before. The fact that it attempts paths in real-time without preprocessing is what I like the most! I definitely need to research this further! I’ll definitely take a look at it. Thank you!

New comment by Farer in "Ask HN: Have you ever seen a pathfinding algorithm of this type?"

Farer — Wed, 08 Jan 2025 03:21:57 +0000

@wormlord

Yes, as you mentioned, the fact that "it’s not guaranteed to always find a solution" is perfectly fine for me. That’s because it feels more natural.

Moreover, since my goal isn’t to always find an answer in the shortest time, this approach aligns even better with my intentions. In my case, I’d like to handle aspects like "trial and error" as part of the learning concept for entities such as rabbits or wolves.

And of course, I’m aiming for something that works well in *dynamic situations*, not just static ones.