Howdy, Stranger!
We are about to switch to a new forum software. Until then we have removed the registration on this forum.
Categories
- All Categories 25.7K
- Announcements & Guidelines 13
- Common Questions 30
- Using Processing 22.1K
- Programming Questions 12.2K
- Questions about Code 6.4K
- How To... 4.2K
- Hello Processing 72
- GLSL / Shaders 292
- Library Questions 4K
- Hardware, Integration & Other Languages 2.7K
- Kinect 668
- Arduino 1K
- Raspberry PI 188
- Questions about Modes 2K
- Android Mode 1.3K
- JavaScript Mode 413
- Python Mode 205
- Questions about Tools 100
- Espanol 5
- Developing Processing 548
- Create & Announce Libraries 211
- Create & Announce Modes 19
- Create & Announce Tools 29
- Summer of Code 2018 93
- Rails Girls Summer of Code 2017 3
- Summer of Code 2017 49
- Summer of Code 2016 4
- Summer of Code 2015 40
- Summer of Code 2014 22
- p5.js 1.6K
- p5.js Programming Questions 947
- p5.js Library Questions 315
- p5.js Development Questions 31
- General 1.4K
- Events & Opportunities 288
- General Discussion 365
A* path finding algorithm minimizing turns
Hi Everyone, I followed the tutorial of the coding train regarding the A* path finding algorithm, it is very useful for one of my project, I tried to modify it to minimize the number of turns. When it calculates the f score, if the next step requires a change of direction I add a small value (0.2). This mod improved the situation reducing the number of turns in the shortest path. But it does not guarantee that it is always the minimum number of turns, sometimes it misses the best solution.
Do you have any suggestion?
Tagged:
Answers
You should consider posting your code. People will be able to see your approach or at least, replicate your attempt.
Kf
https://subutai6@bitbucket.org/subutai6/a-p5.git
Let me know if the link doesn't work.
link to Coding Train video (part 1 of 3)
Yes that video is the initial point, I added few changes to minimize turns but without a complete success.