If enemy sees hero, then fire.(AI)

[moynzy]

Hey guys, I have an enemy ai question.

If(hero is between goblins x pos and visual pos(where he can't see))
Then fire

If not then idle

I want it so the enemy fires when the hero comes close to the goblin.

now i can do this

if(hero.hitTestPoint(goblin,x + 100, goblin.y, true)
//fire

But then if the player is in the middle and not touching the x pos, when I have failed. What do you guys reckon, any tips :D?!

[MSGhero]

At 4/11/14 10:59 PM, moynzy wrote: But then if the player is in the middle and not touching the x pos, when I have failed. What do you guys reckon, any tips :D?!

Stop using hitTestPoint and start using math.

If(hero is between goblins x pos and visual pos(where he can't see))

Turn what you just said into a math equation. It helps to draw it on paper for a visualization.

[GeoKureli]

At 4/11/14 11:09 PM, MSGhero wrote: Stop using hitTestPoint and start using math.

WWPD

What would Pythagoras do?

[moynzy]

At 4/11/14 11:09 PM, MSGhero wrote:

At 4/11/14 10:59 PM, moynzy wrote: But then if the player is in the middle and not touching the x pos, when I have failed. What do you guys reckon, any tips :D?!

Stop using hitTestPoint and start using math.

If(hero is between goblins x pos and visual pos(where he can't see))

Turn what you just said into a math equation. It helps to draw it on paper for a visualization.

Gradients and Normals?
Quadratic Roots?
Curves?
Vector Regions?

I know Maths and Programming goes well together, I'm not a mathematician, but I'm willing to learn in order to develop and create better programs, so please do enlighten me :D!

[MSGhero]

At 4/12/14 12:09 AM, moynzy wrote: I know Maths and Programming goes well together, I'm not a mathematician, but I'm willing to learn in order to develop and create better programs, so please do enlighten me :D!

You don't need quadratic roots to figure out if a number is between 2 other numbers. This is addition and subtraction, inequalities and equations. "If the hero's x is between the enemy's x and the enemy's x plus his vision range, then attack" is pretty much what you said.

[moynzy]

At 4/12/14 12:25 AM, MSGhero wrote:

At 4/12/14 12:09 AM, moynzy wrote: I know Maths and Programming goes well together, I'm not a mathematician, but I'm willing to learn in order to develop and create better programs, so please do enlighten me :D!

You don't need quadratic roots to figure out if a number is between 2 other numbers. This is addition and subtraction, inequalities and equations. "If the hero's x is between the enemy's x and the enemy's x plus his vision range, then attack" is pretty much what you said.

if (_character.x > redGoblin.x && _character.x < redGoblin.x - 300)

I'm working with a different co ordination, not the stages, so I'm getting confused.

But I've tested this and no result/ trace.

[MSGhero]

At 4/12/14 10:08 AM, moynzy wrote: if (_character.x > redGoblin.x && _character.x < redGoblin.x - 300)

These two things can't be true at the same time. Like I said, draw it out. If your hero is at x=200 and the enemy at x=100, is the hero within vision range and why or why not?

[slugrail]

Direction/magnitude independant :

var dist:Number = Math.sqrt(Math.pow(x2-x1,2)+Math.pow(y2-y1,2));
if (dist <= 100) {
    // attack
}

[egg82]

At 4/12/14 08:02 PM, slugrail wrote: var dist:Number = Math.sqrt(Math.pow(x2-x1,2)+Math.pow(y2-y1,2));
if (dist <= 100) {
// attack
}

slightly faster, since Math.pow is incredibly slow.

var dist:Number = Math.sqrt((x2*x2-x1*x1) + (y2*y2-y1*y1));
if (dist <= 100) {
    // attack
}

[Sandremss128]

At 4/12/14 09:34 PM, egg82 wrote: slightly faster, since Math.pow is incredibly slow.

var dist:Number = Math.sqrt((x2*x2-x1*x1) + (y2*y2-y1*y1));
if (dist <= 100) {
// attack
}

Faster still, eliminate the expensive call to Math.sqrt:

var dist:Number = (x2*x2-x1*x1) + (y2*y2-y1*y1);
if (dist <= 100 * 100) {
    // attack
}

[slugrail]

At 4/13/14 05:23 AM, Sandremss128 wrote: Faster still, eliminate the expensive call to Math.sqrt:

var dist:Number = (x2*x2-x1*x1) + (y2*y2-y1*y1);
if (dist <= 100 * 100) {
// attack
}

So it's turning into an optimization battle huh? Hardcoding:

var dist:Number = (x2*x2-x1*x1) + (y2*y2-y1*y1);
 if (dist <= 10000) {
     // attack
 }

Or better yet:

if (false <= true) {
  // attack
}

[Sandremss128]

At 4/13/14 07:46 AM, slugrail wrote: So it's turning into an optimization battle huh? Hardcoding:

var dist:Number = (x2*x2-x1*x1) + (y2*y2-y1*y1);
if (dist <= 10000) {
// attack
}

If the compiler is worth 2 cents it will automatically hardcode that for you.

[Sam]

At 4/13/14 07:46 AM, slugrail wrote: if (false <= true) {
// attack
}

NEXT LEVEL

// attack