Esempio n. 1
0
File: Map.cs Progetto: nubington/rts
        void loadMap(string mapFilePath)
        {
            string[] lines = File.ReadAllLines(mapFilePath);

            string[] widthAndHeight = lines[0].Split(' ');
            width = int.Parse(widthAndHeight[0]);
            height = int.Parse(widthAndHeight[1]);

            tiles = new MapTile[height, width];

            for (int i = 1; i < height + 1; i++)
            {
                string[] rowOfTiles = lines[i].Split(' ');

                for (int s = 0; s < width; s++)
                {
                    int typeCode = int.Parse(rowOfTiles[s].Substring(0, 1));
                    int pathingCode = int.Parse(rowOfTiles[s].Substring(1, 1));
                    tiles[i - 1, s] = new MapTile(s, (i - 1), tileSize, tileSize, typeCode, pathingCode);
                    if (pathingCode == 1)
                        Walls.Add(tiles[i - 1, s]);
                }
            }

            Util.SortByX(Walls);
        }
Esempio n. 2
0
File: Map.cs Progetto: nubington/rts
        void loadMap(string mapFilePath)
        {
            string[] lines = File.ReadAllLines(mapFilePath);

            string[] widthAndHeight = lines[0].Split(' ');
            width = int.Parse(widthAndHeight[0]);
            height = int.Parse(widthAndHeight[1]);
            int numberOfResources = int.Parse(widthAndHeight[2]);
            int numberOfStartingPoints = int.Parse(widthAndHeight[3]);

            tiles = new MapTile[height, width];

            int endOfTileLines = height,
                endOfResourceLines = endOfTileLines + numberOfResources,
                endOfStartingPointLines = endOfResourceLines + numberOfStartingPoints;

            for (int i = 1; i <= endOfTileLines; i++)
            {
                string[] rowOfTiles = lines[i].Split(' ');

                for (int s = 0; s < width; s++)
                {
                    int typeCode = int.Parse(rowOfTiles[s].Substring(0, 1));
                    int pathingCode = int.Parse(rowOfTiles[s].Substring(1, 1));
                    tiles[i - 1, s] = new MapTile(s, (i - 1), tileSize, tileSize, typeCode, pathingCode);
                    //if (pathingCode == 1)
                    //    Walls.Add(tiles[i - 1, s]);
                }
            }

            for (int i = endOfTileLines + 1; i <= endOfResourceLines; i++)
            {
                string[] resourceParams = lines[i].Split(' ');

                resources.Add(new KeyValuePair<Point, int>(new Point(int.Parse(resourceParams[1]), int.Parse(resourceParams[2])), int.Parse(resourceParams[0])));
            }

            for (int i = endOfResourceLines + 1; i <= endOfStartingPointLines; i++)
            {
                string[] resourceParams = lines[i].Split(' ');

                StartingPoints.Add(new Point(int.Parse(resourceParams[0]), int.Parse(resourceParams[1])));
            }

            //Util.SortByX(Walls);

            // create bounding boxes
            BigBoundingBoxes = new BoundingBox[Height / BOUNDING_BOX_SIZE, Width / BOUNDING_BOX_SIZE];
            for (int y = 0; y < Height / BOUNDING_BOX_SIZE; y++)
            {
                for (int x = 0; x < Width / BOUNDING_BOX_SIZE; x++)
                {
                    BigBoundingBoxes[y, x] = new BoundingBox(new Rectangle(x * BOUNDING_BOX_SIZE * TileSize, y * BOUNDING_BOX_SIZE * TileSize, TileSize * BOUNDING_BOX_SIZE, TileSize * BOUNDING_BOX_SIZE));
                }
            }

            // link bounding boxes with tiles
            foreach (BoundingBox box in BigBoundingBoxes)
            {
                for (int x = box.Rectangle.X / TileSize; x < box.Rectangle.X / TileSize + Map.BOUNDING_BOX_SIZE; x++)
                {
                    for (int y = box.Rectangle.Y / TileSize; y < box.Rectangle.Y / TileSize + Map.BOUNDING_BOX_SIZE; y++)
                    {
                        MapTile tile = Tiles[y, x];

                        tile.BoundingBox = box;
                        box.Tiles.Add(tile);
                    }
                }
            }
        }
Esempio n. 3
0
 public PathNode(MapTile tile)
 {
     Tile = tile;
 }
Esempio n. 4
0
File: Map.cs Progetto: bagnalla/RTS
        // find centerpoint of nearest walkable tile from given vector
        public Vector2 FindNearestWalkableTile(Vector2 point)
        {
            int     y    = (int)MathHelper.Clamp(point.Y / tileSize, 0, height - 1);
            int     x    = (int)MathHelper.Clamp(point.X / tileSize, 0, width - 1);
            MapTile tile = tiles[y, x];

            if (tile.Walkable)
            {
                return(tile.CenterPoint);
            }

            MapTile neighbor;

            // find nextdoor neighbor closer to given vector
            float howFarLeft  = tile.CenterPoint.X - point.X;
            float howFarRight = point.X - tile.CenterPoint.X;
            float howFarUp    = tile.CenterPoint.Y - point.Y;
            float howFarDown  = point.Y - tile.CenterPoint.Y;

            float biggest = 0;

            if (howFarLeft > biggest)
            {
                biggest = howFarLeft;
            }
            if (howFarRight > biggest)
            {
                biggest = howFarRight;
            }
            if (howFarUp > biggest)
            {
                biggest = howFarUp;
            }
            if (howFarDown > biggest)
            {
                biggest = howFarDown;
            }

            if (howFarLeft == biggest && x - 1 >= 0)
            {
                neighbor = tiles[y, x - 1];
                if (neighbor.Walkable)
                {
                    return(neighbor.CenterPoint);
                }
            }
            else if (howFarRight == biggest && x + 1 < width)
            {
                neighbor = tiles[y, x + 1];
                if (neighbor.Walkable)
                {
                    return(neighbor.CenterPoint);
                }
            }
            else if (howFarUp == biggest && y - 1 >= 0)
            {
                neighbor = tiles[y - 1, x];
                if (neighbor.Walkable)
                {
                    return(neighbor.CenterPoint);
                }
            }
            else if (howFarDown == biggest && y + 1 < height)
            {
                neighbor = tiles[y + 1, x];
                if (neighbor.Walkable)
                {
                    return(neighbor.CenterPoint);
                }
            }

            // find next closest neighbor
            for (int i = 0; ; i++)
            {
                if (y - i >= 0)
                {
                    neighbor = tiles[y - i, x];
                    if (neighbor.Walkable)
                    {
                        return(neighbor.CenterPoint);
                    }
                }
                if (y + i < height)
                {
                    neighbor = tiles[y + i, x];
                    if (neighbor.Walkable)
                    {
                        return(neighbor.CenterPoint);
                    }
                }
                if (x - i >= 0)
                {
                    neighbor = tiles[y, x - i];
                    if (neighbor.Walkable)
                    {
                        return(neighbor.CenterPoint);
                    }
                }
                if (x + i < width)
                {
                    neighbor = tiles[y, x + i];
                    if (neighbor.Walkable)
                    {
                        return(neighbor.CenterPoint);
                    }
                }
                if (y - i >= 0 && x - i >= 0)
                {
                    neighbor = tiles[y - i, x - i];
                    if (neighbor.Walkable)
                    {
                        return(neighbor.CenterPoint);
                    }
                }
                if (y - i >= 0 && x + i < width)
                {
                    neighbor = tiles[y - i, x + i];
                    if (neighbor.Walkable)
                    {
                        return(neighbor.CenterPoint);
                    }
                }
                if (y + i < height && x - i >= 0)
                {
                    neighbor = tiles[y + i, x - i];
                    if (neighbor.Walkable)
                    {
                        return(neighbor.CenterPoint);
                    }
                }
                if (y + i < height && x + i < width)
                {
                    neighbor = tiles[y + i, x + i];
                    if (neighbor.Walkable)
                    {
                        return(neighbor.CenterPoint);
                    }
                }
            }
        }
Esempio n. 5
0
        void loadMap(string mapFilePath)
        {
            string[] lines = File.ReadAllLines(mapFilePath);

            string[] widthAndHeight = lines[0].Split(' ');
            Width  = int.Parse(widthAndHeight[0]);
            Height = int.Parse(widthAndHeight[1]);
            int numberOfResources      = int.Parse(widthAndHeight[2]);
            int numberOfStartingPoints = int.Parse(widthAndHeight[3]);

            Tiles = new MapTile[Height, Width];

            int endOfTileLines          = Height,
                endOfResourceLines      = endOfTileLines + numberOfResources,
                endOfStartingPointLines = endOfResourceLines + numberOfStartingPoints;

            for (int i = 1; i <= endOfTileLines; i++)
            {
                string[] rowOfTiles = lines[i].Split(' ');

                for (int s = 0; s < Width; s++)
                {
                    int typeCode    = int.Parse(rowOfTiles[s].Substring(0, 1));
                    int pathingCode = int.Parse(rowOfTiles[s].Substring(1, 1));
                    Tiles[i - 1, s] = new MapTile(this, s, (i - 1), tileSize, tileSize, typeCode, pathingCode);
                    //if (pathingCode == 1)
                    //    Walls.Add(Tiles[i - 1, s]);
                }
            }

            for (int i = endOfTileLines + 1; i <= endOfResourceLines; i++)
            {
                string[] resourceParams = lines[i].Split(' ');

                resources.Add(new KeyValuePair <Point, int>(new Point(int.Parse(resourceParams[1]), int.Parse(resourceParams[2])), int.Parse(resourceParams[0])));
            }

            for (int i = endOfResourceLines + 1; i <= endOfStartingPointLines; i++)
            {
                string[] resourceParams = lines[i].Split(' ');

                StartingPoints.Add(new Point(int.Parse(resourceParams[0]), int.Parse(resourceParams[1])));
            }

            //Util.SortByX(Walls);

            // create bounding boxes
            BigBoundingBoxes = new BoundingBox[Height / BOUNDING_BOX_SIZE, Width / BOUNDING_BOX_SIZE];
            for (int y = 0; y < Height / BOUNDING_BOX_SIZE; y++)
            {
                for (int x = 0; x < Width / BOUNDING_BOX_SIZE; x++)
                {
                    BigBoundingBoxes[y, x] = new BoundingBox(new Rectangle(x * BOUNDING_BOX_SIZE * TileSize, y * BOUNDING_BOX_SIZE * TileSize, TileSize * BOUNDING_BOX_SIZE, TileSize * BOUNDING_BOX_SIZE));
                }
            }

            // link bounding boxes with tiles
            foreach (BoundingBox box in BigBoundingBoxes)
            {
                for (int x = box.Rectangle.X / TileSize; x < box.Rectangle.X / TileSize + Map.BOUNDING_BOX_SIZE; x++)
                {
                    for (int y = box.Rectangle.Y / TileSize; y < box.Rectangle.Y / TileSize + Map.BOUNDING_BOX_SIZE; y++)
                    {
                        MapTile tile = Tiles[y, x];

                        tile.BoundingBox = box;
                        box.Tiles.Add(tile);
                    }
                }
            }
        }