Show Posts
This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
136
Tips, Tutorials, Examples / Re: Chesee finder - pathfinding and collision engine
« on: October 08, 2010, 06:18:21 am »
Com'on, I'm doing this for the community and I'll release the code as open source. The dll could have a MIT license, if you don't like GPL.
Well, I now have a complete C++ CodeBlocks project, and I need to make a dll out of it, so I can use it with Game Maker too.
Anybody knows how to make a Game Maker dlls? Is that any different from making a dll for another program?
The GMC dll topic sucks. It's full of C++ tutorials, and i can't find any useful information.
Well, I now have a complete C++ CodeBlocks project, and I need to make a dll out of it, so I can use it with Game Maker too.
Anybody knows how to make a Game Maker dlls? Is that any different from making a dll for another program?
The GMC dll topic sucks. It's full of C++ tutorials, and i can't find any useful information.
137
Tips, Tutorials, Examples / Re: Chesee finder - pathfinding and collision engine
« on: October 07, 2010, 12:00:07 pm »
I hired a C++ coder to make the functions I needed, we are testing it out now. Probably it's easier (and better) to make a .dll out of it instead of converting the code to GML.
Anybody wants to help?
Anybody wants to help?
138
Announcements / Re: Proceedings
« on: October 02, 2010, 06:15:05 am »the Red Hat team chose to write the exception off of which ENIGMA's is basedOk, this makes me feel a little more secure.
139
Announcements / Re: Proceedings
« on: October 01, 2010, 07:04:48 am »Full License TextYou should really specify it is GPLv3 you are talking about, and link to http://www.gnu.org/licenses/gpl-3.0.html
You should have received a copy of the GNU General Public License along with this program; if not, see <www.gnu.org/licenses>.
140
Announcements / Re: Proceedings
« on: October 01, 2010, 05:10:09 am »
Couldn't we hire a lawyer, or ask the Software Freedom Law Center for free help?
GLPv2 was easy to understand, but GPLv3, the one you are using, is full of legalese. It may even contain something that prohibits this kind of exception
At best we could just copy the classpath exception of GCC. Netbeans is double-licensed CDDL and GPLv3 and has similar exceptions.
GLPv2 was easy to understand, but GPLv3, the one you are using, is full of legalese. It may even contain something that prohibits this kind of exception
At best we could just copy the classpath exception of GCC. Netbeans is double-licensed CDDL and GPLv3 and has similar exceptions.
141
Tips, Tutorials, Examples / Re: Chesee finder - pathfinding and collision engine
« on: September 27, 2010, 05:52:38 pm »
Thank you. My vectors have 3 dimensions, I build them from the segments.
Your formula is correct, I found a similar one here
However, I can't get the code to work. No errors, it just returns nonsense. I think I translated the code correctly...
example here
Your formula is correct, I found a similar one here
However, I can't get the code to work. No errors, it just returns nonsense. I think I translated the code correctly...
example here
142
Tips, Tutorials, Examples / Re: Chesee finder - pathfinding and collision engine
« on: September 27, 2010, 03:52:22 pm »
News. I converted a 3d C++ function to find the distance between 2 segments into a GML script. Here's an example, this thing can recognized intersections too!
I'm now trying to convert another function from the same site, but i got stuck because of a vectorial cross product.
If I have 2 vectors, u(u_x1,u_y1,u_z1,u_x2,u_y2,u_z2) and v(v_x1,v_y1,v_z1,v_x2,v_y2,v_z2), how do I calculate the vector w = u x v ?
w must perpendicular to both u and w, that's all I know
I'm now trying to convert another function from the same site, but i got stuck because of a vectorial cross product.
If I have 2 vectors, u(u_x1,u_y1,u_z1,u_x2,u_y2,u_z2) and v(v_x1,v_y1,v_z1,v_x2,v_y2,v_z2), how do I calculate the vector w = u x v ?
w must perpendicular to both u and w, that's all I know
143
Tips, Tutorials, Examples / Re: Chesee finder - pathfinding and collision engine
« on: September 25, 2010, 12:59:01 pm »
The only script I really need is one that returns the distance of a segment from triangle, in 3d. If there is an intersection, I need it to return 0.
The other script, the one that returns the z of a x-y point inside the triangle is also necessary, but should be much easier to retrieve.
I would like it to work with GM too, but so far I have found nothing useful, be it C++ or GML.
If somebody can solve my problem I can buy him/her a Steam game. I'm tired of waiting, I'll have to learn C++ later this year at my university, but right now I want to finish this.
EDIT: maybe I got a chance. Here is a simple code that can account for ray/segment collisions with a triangle. If there is no intersection, then I suppose that the segment-triangle distance is the smallest distance between the segment the 3 sides of the triangle. On the same site, I also found some code that can do that.
I think I can convert this script by myself. There are custom types defined in order to use custom operations, but there's hope.
But I still another script to calculate the distance between 2 segments, and I can't find any straightforward code.
The other script, the one that returns the z of a x-y point inside the triangle is also necessary, but should be much easier to retrieve.
I would like it to work with GM too, but so far I have found nothing useful, be it C++ or GML.
If somebody can solve my problem I can buy him/her a Steam game. I'm tired of waiting, I'll have to learn C++ later this year at my university, but right now I want to finish this.
EDIT: maybe I got a chance. Here is a simple code that can account for ray/segment collisions with a triangle. If there is no intersection, then I suppose that the segment-triangle distance is the smallest distance between the segment the 3 sides of the triangle. On the same site, I also found some code that can do that.
I think I can convert this script by myself. There are custom types defined in order to use custom operations, but there's hope.
But I still another script to calculate the distance between 2 segments, and I can't find any straightforward code.
144
Tips, Tutorials, Examples / Re: Chesee finder - pathfinding and collision engine
« on: September 25, 2010, 01:09:13 am »
Thank you for the extensive answer. Somebody probably tryed too hard to "be smart" with that cryptic coding. What a pity.
I found the new distance functions from Wild Magic 5, maybe these work properly, although I doubt it.
segment to segment .cpp and .h
segment to triangle .cpp and .h
segment to triangle .cpp and .h
Do you know of a place where I could find similar scripts? I am no matematician.
btw is there some way I could get you to convert this to gml so that it compiles?
I found the new distance functions from Wild Magic 5, maybe these work properly, although I doubt it.
segment to segment .cpp and .h
segment to triangle .cpp and .h
segment to triangle .cpp and .h
Do you know of a place where I could find similar scripts? I am no matematician.
btw is there some way I could get you to convert this to gml so that it compiles?
145
Tips, Tutorials, Examples / Re: Chesee finder - pathfinding and collision engine
« on: September 24, 2010, 03:34:32 pm »
Thanks for trying, that's some complex C++ indeed. I know some of it, but objects and classes are out of my reach.
btw is Josh still around?
btw is Josh still around?
146
Tips, Tutorials, Examples / Re: Chesee finder - pathfinding and collision engine
« on: September 24, 2010, 11:08:14 am »
I've been making some projects. I found a site full of useful C++ code. Now I need to convert this C++ code to GML.
Here's the code for a segment-triangle distance script. .cpp and .h <- more important
Here's the code for a rectangle-triangle distance script. .cpp and .h
If somebody needs a prize in order to help me, we can talk about that.
Here's the code for a segment-triangle distance script. .cpp and .h <- more important
Here's the code for a rectangle-triangle distance script. .cpp and .h
If somebody needs a prize in order to help me, we can talk about that.
147
Tips, Tutorials, Examples / Re: Chesee finder - pathfinding and collision engine
« on: September 23, 2010, 05:17:08 pm »
Sigh, no time to do that. I'm already trying to port this in a 3d environment.
I need 2 script (pure gml please):
- one to measure the distance of a segment from a given triangle in 3d (needed to know if a bullet pierced the floor) <- more difficult
- one to find the z value of a triangle point given its x and y (needed to move units according to the height of the floor)
I need 2 script (pure gml please):
- one to measure the distance of a segment from a given triangle in 3d (needed to know if a bullet pierced the floor) <- more difficult
- one to find the z value of a triangle point given its x and y (needed to move units according to the height of the floor)
148
Tips, Tutorials, Examples / Re: Chesee finder - pathfinding and collision engine
« on: September 21, 2010, 05:29:01 am »Ah, yes. Waypoint pathfinding. Valve's solution to botsUnits can go outside of the waypoints connections as long as they don't cross walls..
It has some similarities to a navgraph.
I'll post this on the GMC when I'll get some input from this community. I posted on the U3D forum too.
So, any suggestions?
149
Tips, Tutorials, Examples / Re: Chesee finder - pathfinding and collision engine
« on: September 19, 2010, 06:30:39 am »
No BBox nor pixels, your units are treated as circles by the collision system so that they can and turn in place when needed, like in most RTS games,
but, unlike in most RTS, units will never overlap.
However, this may not be good for a car race game because of the simplified physics.
I'm Italian, btw, sorry for the accent.
but, unlike in most RTS, units will never overlap.
However, this may not be good for a car race game because of the simplified physics.
I'm Italian, btw, sorry for the accent.
150
Tips, Tutorials, Examples / Chesee finder - pathfinding and collision engine
« on: September 18, 2010, 09:50:19 am »
I guess you need something simple yet effective. I think I've got a solid solution to your problems,
wheter you are coding top-down shooters, RPG or a RTS games, this engine can help you moving
your units fast and reliably.
Doesn't matter how big your maps are, or how big your armies are, this thing is designed to SCALE
for all your needs. I've tested labyrinthic maps full of bottlenecks and get it to work smoothly.
I won't lie to you, this thing is pretty advanced, but I've worked to make it as easy to use, but with
a radical design in mind, you are the one in control. You get to know how it works when you design
map, but you can change the most important parameters of your units without a need to understand
all the underlying math. However, if you are curious to know how it works, the code is commented.
Still i suggest you watching this video tutorial in order to get started. BTW Can't incorporate vieo in post?
Download
Here is a partial list of features:
Path-finding:
- quick and simple BFS algorithm
- incorporated smoothing
- GM-functions free (no mp_grids)
- full GML, no dlls
Path following
- units can avoid each other without smashing into walls
- can handle queues and bottlenecks
- customizable steering options
Collision engine:
- doesn't use sprites (will be easy to port on Enigma)
- can handle really fast units
- "collision_line_width" like functions
- "collision_line_first" like functions can be implemented
- splits the maps into cells to cut down pointless checks
Editor:
- easy to use
- lets you build your own paths
- eliminates the need of having dozens of wall objects
Others:
- supports units of various sizes
- GM save and load won't work, use the custom replacement
To do:
- 3d support, can be achieved through layers
- more tutorials, on demand
Notes:
- units will never give up seeking their way until they can see their destination, can be changed on demand
- if the destination point is too close to a wall, units won't even try to get there, no quick fix
wheter you are coding top-down shooters, RPG or a RTS games, this engine can help you moving
your units fast and reliably.
Doesn't matter how big your maps are, or how big your armies are, this thing is designed to SCALE
for all your needs. I've tested labyrinthic maps full of bottlenecks and get it to work smoothly.
I won't lie to you, this thing is pretty advanced, but I've worked to make it as easy to use, but with
a radical design in mind, you are the one in control. You get to know how it works when you design
map, but you can change the most important parameters of your units without a need to understand
all the underlying math. However, if you are curious to know how it works, the code is commented.
Still i suggest you watching this video tutorial in order to get started. BTW Can't incorporate vieo in post?
Download
Here is a partial list of features:
Path-finding:
- quick and simple BFS algorithm
- incorporated smoothing
- GM-functions free (no mp_grids)
- full GML, no dlls
Path following
- units can avoid each other without smashing into walls
- can handle queues and bottlenecks
- customizable steering options
Collision engine:
- doesn't use sprites (will be easy to port on Enigma)
- can handle really fast units
- "collision_line_width" like functions
- "collision_line_first" like functions can be implemented
- splits the maps into cells to cut down pointless checks
Editor:
- easy to use
- lets you build your own paths
- eliminates the need of having dozens of wall objects
Others:
- supports units of various sizes
- GM save and load won't work, use the custom replacement
To do:
- 3d support, can be achieved through layers
- more tutorials, on demand
Notes:
- units will never give up seeking their way until they can see their destination, can be changed on demand
- if the destination point is too close to a wall, units won't even try to get there, no quick fix