Challenge Threadᆦ ᆦ ᆦ

[Homicide13]

Technically, you can determine an ending point by lack of collision of all sides, since the "matchbox" is going to be falling off the stage anyway.

If you did that though wouldn't the script deem a four way intersection to be a proper stopping point? D: (as far as I know, you can't detect collision with a plane - only entities.)

[Your Computer]

If you did that though wouldn't the script deem a four way intersection to be a proper stopping point? D: (as far as I know, you can't detect collision with a plane - only entities.)

Yeah, but in neither of the four maps used to test the script will you encounter such a scenario.

[Homicide13]

Yeah, but in neither of the four maps used to test the script will you encounter such a scenario.

True, but for the sake of being thorough... ;_;

[Your Computer]

True, but for the sake of being thorough... ;_;

The intersection would have to be pretty wide and far apart, anyway. The A* search algorithm uses 8 boxes for path finding, so if the corner boxes collide with the corners of the intersection, it won't end there.

[Apjjm]

Just to clarify, in the video do you have a pathnode (or i guess script area) to represent the end of the maze, or did you make the algorithm using the exact same map in the download link?

I made the end node a specific point on the map (an arbitrary point outside the maze). I then made my goal test a simple point-in-cube test, and used straight line distance (divided by width of node to guarantee admissibility) as my heuristic function.

I used the exact same maze as is in the download link.

[nemesis567]

My first solution uses an array to represent the map into a simplified version so that you only determine the collision for each map and the coordinates of the start and ending point.

[Homicide13]

Just to clarify, in the video do you have a pathnode (or i guess script area) to represent the end of the maze, or did you make the algorithm using the exact same map in the download link?

I made the end node a specific point on the map (an arbitrary point outside the maze). I then made my goal test a simple point-in-cube test, and used straight line distance (divided by width of node to guarantee admissibility) as my heuristic function.

I used the exact same maze as is in the download link.

Hm but you did edit the map file and add a script area at the end then? Or you just determined a point using you code?

[Apjjm]

I just picked far away coordinate ( (0,0,35) or something) so that it would be outside all of the maps, no changes to any of the maps were necessary.

[Homicide13]

I just picked far away coordinate ( (0,0,35) or something) so that it would be outside all of the maps, no changes to any of the maps were necessary.

Alright, that's what I assumed but I just wanted to make sure, so I didn't try to start solving something that I wouldn't really be able to resolve.

[Homicide13]

Hm the big problem I'm having with this challenge is that in order to determine if a space is free (and therefore if it should be considered an acceptable path) I would have to attach an object to the matchbox, add a collide callback, and then wait and only have the algorithm continue if some global variable wasn't changed by the collide callback. Does anyone know a specific way around this or am I just doomed to have the computer wait 0.1f seconds between each iteration?