What will be the best algorithm or logic that can be used for game like greedy spiders. As far as I can think it is based on A* algorithm ? where the shortest path has to be search between the spider and the flies....
is there any better logic to implement that game ?
I would like to learn the concept behind it ? How they will be managing nodes and edges concept ?
I am planning to make such game but do not know from where should I start
6 Replies  991 Views  Last Post: 26 July 2012  10:41 PM
#1
How to go about game like geedy spiders or Logic behind it?
Posted 26 June 2012  06:36 AM
Replies To: How to go about game like geedy spiders or Logic behind it?
#2
Re: How to go about game like geedy spiders or Logic behind it?
Posted 26 June 2012  06:47 AM
A* is probably going to be the best algorithm to use if you're wanting to find the shortest path. You could probably even modify it a bit to allow for a bit of wandering.
#3
Re: How to go about game like geedy spiders or Logic behind it?
Posted 25 July 2012  08:32 PM
Thanks bro !!!
#5
Re: How to go about game like geedy spiders or Logic behind it?
Posted 26 July 2012  05:59 PM
I was looking at greedy spiders and it doesnt use pure A*. It also checks how many options there are for vertex so that you cant trap it as easily, but most games wouldnt need this because usually the movement points are static.
#6
Re: How to go about game like geedy spiders or Logic behind it?
Posted 26 July 2012  08:31 PM
AlexSleyore, on 26 July 2012  05:59 PM, said:
I was looking at greedy spiders and it doesnt use pure A*. It also checks how many options there are for vertex so that you cant trap it as easily, but most games wouldnt need this because usually the movement points are static.
How many options there are for vertex means ? Its manipulating A* by checking all the possible flies and first its finding the closest flies ? is it that way ?
#7
Re: How to go about game like geedy spiders or Logic behind it?
Posted 26 July 2012  10:41 PM
sanghai45, on 26 July 2012  08:31 PM, said:
AlexSleyore, on 26 July 2012  05:59 PM, said:
I was looking at greedy spiders and it doesnt use pure A*. It also checks how many options there are for vertex so that you cant trap it as easily, but most games wouldnt need this because usually the movement points are static.
How many options there are for vertex means ? Its manipulating A* by checking all the possible flies and first its finding the closest flies ? is it that way ?
A* checks in 4 directions and connects to 4 other vertexs in a grid, the Spiders in that game move along the webs so there can be 17ish webs attached at one point.
Page 1 of 1
