[ Login | Register ]

The Shining Source

Show Posts

Pages: 1 ... 5 6 [7] 8 9 10

91   Euro 2004
Quote from: "Ty"
England will win Euro 2004.

Then I will finish TSS.

Which is more likely? Tongue


Good, TSS will be finished in advance...

92   SFTA (update)
It's really nice artwork. Is it going to be the characters' portraits? I wonder how those will look in 3D... How is it to design 3D characters?

93   Euro 2004
After yesterday's match, I think Portugal could well go all the way to the final victory...

94   Euro 2004
I would bet on Italy, although they're not that good, but, tell me, who's that good? Not the French...  Sad

95   if anyone rembers(or even cares)
Hey, I didn't remember, but I care... It's quite funny...
I hope you'll continue...

96   SFW is back!
I didn't mean that actually...
Thanks for the links to Shining Odyssey from TSS, by the way...

97   {Graphics} Sprite
I'm objectively totally disoriented...

98   the one word story thread!
banana

99   {Graphics} Sprite
C++ is not object-oriented?
Holy Cows, I had thought the opposite for 2 years...
Well, I'm still using it for Shining odyssey, no matter if it is object-oriented or not, now that I have started with it...

100   SFW is back!
I love the "projects" page... Would love to be in there...

101   {Graphics} Sprite
I don't know how many of these you intend to draw, but I wish you good luck and patience...

102   J#
So that makes one more language I know nothing of...

103   Keep an eye on your inbox
I've reveived it.
I will answer it shortly.... hopefully...

104   an ai idea
I don't think it would be that hard to program. However, it might be difficult to debug, and it might give very incoherent ennemy behavior depending of the coefficients you use.

In Shining odyssey, the ennemy very basic AI chooses (randomly or fixed) between a few strategies: Run for hero, run for weakest character, run for closest character, random of the the last three for each turn. I don't have any healing/protecting function at the moment.

However, when the ennemy runs for the hero, but doesn't reach him, if he stops close to a party member, the enemy should "think" of attacking that party member.

Check the following case:
Before move:

XXXXXXXX
HPXXXXXX
PXXXXXEX

E: Enemy (strategy: Run for hero), P: party member 1 and 2, H: hero:

After move:

XXXXXXXX
HPXXXXXX
PEXXXXXX

Which P is E going to attack? You need a second level of strategy here. Strategy 1: Run for hero, Strategy 2 (if strategy 1 impossible): Run for weakest.

Here, in addition to Ben's case, E first applies strategy1 as much as possible. Then he applies strategy2.

Of course, more subsidiary strategies could be possible.
I thought that a good idea would be allow more ennemy strategies as the ennemy's level grow. A level 1 foe would only have one strategy (run for hero and stop, even if standing close an other party member)

In Ben's algorithm in my case (provided the hero is "unreachable"), E would probably move in the same way and attack the same party member P, but the calculation would be different. It would be:
1. calculate score for attacking hero.
2. calculate score for attacking party member 1
3. calculate score for attacking party member 3
4. What's highest score? Perform chosen action.

105   Dark Resurrection 3D
Any news from this project recently?


Pages: 1 ... 5 6 [7] 8 9 10

Powered by SMF 1.1.21 | SMF © 2013, Simple Machines