private static void checkShotWallImpacts(Sprite shot)
{
if (shot.Expired)
{
return;
}
if (TileMap.IsWallTile(
TileMap.GetSquareAtPixel(shot.WorldCenter)))
{
shot.Expired = true;
}
}
public static void AddComputerTerminal()
{
int startX = rand.Next(2, TileMap.MapWidth - 2);
int startY = rand.Next(0, TileMap.MapHeight - 2);
Vector2 tileLocation = new Vector2(startX, startY);
if ((TerminalInSquare(tileLocation) != null) ||
(TileMap.IsWallTile(tileLocation)))
{
return;
}
if (Vector2.Distance(
TileMap.GetSquareCenter(startX, startY),
Player.BaseSprite.WorldCenter) < minDistanceFromPlayer)
{
return;
}
List <Vector2> path =
PathFinder.FindPath(
new Vector2(startX, startY),
TileMap.GetSquareAtPixel(
Player.BaseSprite.WorldCenter));
if (path != null)
{
Rectangle squareRect =
TileMap.SquareWorldRectangle(startX, startY);
Sprite activeSprite = new Sprite(
new Vector2(squareRect.X, squareRect.Y),
texture,
initialActiveFrame,
Vector2.Zero);
for (int x = 1; x < 3; x++)
{
activeSprite.AddFrame(
new Rectangle(
initialActiveFrame.X + (x *
initialActiveFrame.Width),
initialActiveFrame.Y,
initialActiveFrame.Width,
initialActiveFrame.Height));
}
activeSprite.CollisionRadius = 15;
Sprite disabledSprite = new Sprite(
new Vector2(squareRect.X, squareRect.Y),
texture,
initialDisabledFrame,
Vector2.Zero);
for (int x = 1; x < 3; x++)
{
disabledSprite.AddFrame(
new Rectangle(
initialDisabledFrame.X + (x *
initialDisabledFrame.Width),
initialDisabledFrame.Y,
initialDisabledFrame.Width,
initialDisabledFrame.Height));
}
ComputerTerminal terminal = new ComputerTerminal(
activeSprite,
disabledSprite,
new Vector2(startX, startY));
float timerOffset = (float)rand.Next(1, 100);
terminal.LastSpawnCounter = timerOffset / 100f;
computerTerminals.Add(terminal);
activeCount++;
}
}
static private List <PathNode> findAdjacentNodes(
PathNode currentNode,
PathNode endNode)
{
List <PathNode> adjacentNodes = new List <PathNode>();
int X = currentNode.GridX;
int Y = currentNode.GridY;
bool upLeft = true;
bool upRight = true;
bool downLeft = true;
bool downRight = true;
if ((X > 0) && (!TileMap.IsWallTile(X - 1, Y)))
{
adjacentNodes.Add(new PathNode(
currentNode,
endNode,
new Vector2(X - 1, Y),
CostStraight + currentNode.DirectCost));
}
else
{
upLeft = false;
downLeft = false;
}
if ((X < 49) && (!TileMap.IsWallTile(X + 1, Y)))
{
adjacentNodes.Add(new PathNode(
currentNode,
endNode,
new Vector2(X + 1, Y),
CostStraight + currentNode.DirectCost));
}
else
{
upRight = false;
downRight = false;
}
if ((Y > 0) && (!TileMap.IsWallTile(X, Y - 1)))
{
adjacentNodes.Add(new PathNode(
currentNode,
endNode,
new Vector2(X, Y - 1),
CostStraight + currentNode.DirectCost));
}
else
{
upLeft = false;
upRight = false;
}
if ((Y < 49) && (!TileMap.IsWallTile(X, Y + 1)))
{
adjacentNodes.Add(new PathNode(
currentNode,
endNode,
new Vector2(X, Y + 1),
CostStraight + currentNode.DirectCost));
}
else
{
downLeft = false;
downRight = false;
}
if ((upLeft) && (!TileMap.IsWallTile(X - 1, Y - 1)))
{
adjacentNodes.Add(new PathNode(
currentNode,
endNode,
new Vector2(X - 1, Y - 1),
CostDiagonal + currentNode.DirectCost));
}
if ((upRight) && (!TileMap.IsWallTile(X + 1, Y - 1)))
{
adjacentNodes.Add(new PathNode(
currentNode,
endNode,
new Vector2(X + 1, Y - 1),
CostDiagonal + currentNode.DirectCost));
}
if ((downLeft) && (!TileMap.IsWallTile(X - 1, Y + 1)))
{
adjacentNodes.Add(new PathNode(
currentNode,
endNode,
new Vector2(X - 1, Y + 1),
CostDiagonal + currentNode.DirectCost));
}
if ((downRight) && (!TileMap.IsWallTile(X + 1, Y + 1)))
{
adjacentNodes.Add(new PathNode(
currentNode,
endNode,
new Vector2(X + 1, Y + 1),
CostDiagonal + currentNode.DirectCost));
}
return(adjacentNodes);
}
static public List <Vector2> FindPath(
Vector2 startTile,
Vector2 endTile)
{
if (TileMap.IsWallTile(endTile) ||
TileMap.IsWallTile(startTile))
{
return(null);
}
openList.Clear();
nodeCosts.Clear();
nodeStatus.Clear();
PathNode startNode;
PathNode endNode;
endNode = new PathNode(null, null, endTile, 0);
startNode = new PathNode(null, endNode, startTile, 0);
addNodeToOpenList(startNode);
while (openList.Count > 0)
{
PathNode currentNode = openList[openList.Count - 1];
if (currentNode.IsEqualToNode(endNode))
{
List <Vector2> bestPath = new List <Vector2>();
while (currentNode != null)
{
bestPath.Insert(0, currentNode.GridLocation);
currentNode = currentNode.ParentNode;
}
return(bestPath);
}
openList.Remove(currentNode);
nodeCosts.Remove(currentNode.GridLocation);
foreach (
PathNode possibleNode in
findAdjacentNodes(currentNode, endNode))
{
if (nodeStatus.ContainsKey(possibleNode.GridLocation))
{
if (nodeStatus[possibleNode.GridLocation] ==
NodeStatus.Closed)
{
continue;
}
if (
nodeStatus[possibleNode.GridLocation] ==
NodeStatus.Open)
{
if (possibleNode.TotalCost >=
nodeCosts[possibleNode.GridLocation])
{
continue;
}
}
}
addNodeToOpenList(possibleNode);
}
nodeStatus[currentNode.GridLocation] = NodeStatus.Closed;
}
return(null);
}