public int personality(int enemy, NavNodes neighbor, int currX, int currZ)
{
int total = 0;
//Each personality prefers a different corner to patrol
// 0 prefers top right, 1 prefers top left, 2 prefers bottom left, 3 prefers bottom right
switch (enemy)
{
case 0:
if ((int)neighbor.ownPosition.x > currX || (int)neighbor.ownPosition.z > currZ)
{
total += 24;
}
else
{
total += 3;
}
break;
case 1:
if ((int)neighbor.ownPosition.x < currX || (int)neighbor.ownPosition.z > currZ)
{
total += 24;
}
else
{
total += 3;
}
break;
case 2:
if ((int)neighbor.ownPosition.x < currX || (int)neighbor.ownPosition.z < currZ)
{
total += 24;
}
else
{
total += 3;
}
break;
case 3:
if ((int)neighbor.ownPosition.x > currX || (int)neighbor.ownPosition.z < currZ)
{
total += 24;
}
else
{
total += 3;
}
break;
default:
break;
}
return(total);
}
public Vector3 GetNext(bool start, int prevX, int prevZ, int enemyPerson, bool huntActive,
out bool update, out int currX, out int currZ)
{
currX = (int)ownPosition.x;
currZ = (int)ownPosition.z;
if (!start)
{
update = false;
int total = 0;
// Build a target options array while excluding previous nav node
NavNodes[] options = new NavNodes[neighbors.Length - 1];
int[] opts = new int[options.Length];
int j = 0;
int piece;
for (int i = 0; i < neighbors.Length; i++)
{
//Exclude the nav node the neemy just came from
if ((int)neighbors[i].ownPosition.x != prevX || (int)neighbors[i].ownPosition.z != prevZ)
{
//Call personality function to see what the weighting for this option is
piece = personality(enemyPerson, neighbors[i], currX, currZ);
//If hunt is not active yet (game started < 10 seconds ago)
//then discourage enemies from moving closer to player
if (!huntActive)
{
piece = piece * ((int)(125 / CalcEuclidean((int)neighbors[i].ownPosition.x,
(int)PlayerController.PlayerPosition.x + 3,
(int)neighbors[i].ownPosition.z, (int)PlayerController.PlayerPosition.z + 30)));
}
total += piece;
opts[j] = total;
options[j] = neighbors[i];
j += 1;
}
}
//Pick a random next neighbor while taking into account the personality weighting
System.Random rndo = new System.Random();
int nextIndexI = rndo.Next(0, total);
for (int i = 0; i < opts.Length; i++)
{
if (opts[i] > nextIndexI)
{
return(options[i].ownPosition);
}
}
return(options[0].ownPosition);
}
update = false;
//Pick a random next neighbor without preference weighting
System.Random rnd = new System.Random();
int nextIndex = rnd.Next(0, neighbors.Length);
return(neighbors[nextIndex].ownPosition);
}
private void InitNode()
{
NumberNodes = _src.GiveMe();
NumberMetaData = _src.GiveMe();
if (NumberNodes > 0)
{
for (int i = 0; i < NumberNodes; i++)
{
NavNodes.Add(new NavigationNode(_src));
}
}
if (NumberMetaData > 0)
{
for (int j = 0; j < NumberMetaData; j++)
{
MetaData.Add(_src.GiveMe());
}
}
}
