public Vector2[] path = new Vector2[10000];
        public int pathlength;   

  public void updatepath(Tile[,] grid, Vector2 startposition, Vector2 target)
        {
                     
        Vector2[] searchedlist = new Vector2[1000];
        int searchedlistnumber = 0;

            int currentx = (int)startposition.X;
            int currenty = (int)startposition.Y;
            searchedlistnumber = 0;
            
            pathlength = 0;
            path = new Vector2[10000];


        restart:

            grid[currentx, currenty].closed = true;

            if (currentx - 1 >= 0)
            {
                if (grid[currentx - 1, currenty].isblocked == false && grid[currentx-1, currenty].closed == false)
                {

                    float pathg = 20 * Math.Abs(startposition.X - currentx + 1) + 20 * Math.Abs(startposition.Y - currenty);

                    if (grid[currentx - 1, currenty].pathF == 0)
                    {
                        searchedlist[searchedlistnumber] = new Vector2(currentx - 1, currenty);
                        searchedlistnumber += 1;
                    }

                    if (pathg < grid[currentx - 1, currenty].pathG || grid[currentx - 1, currenty].pathG == 0)
                    {
                        grid[currentx - 1, currenty].pathG = pathg;
                        grid[currentx - 1, currenty].parenttile = new Vector2(currentx, currenty);
                    }

                    grid[currentx - 1, currenty].pathH = 20 * Math.Abs(target.X - currentx + 1) + 20 * Math.Abs(target.Y - currenty);
                    grid[currentx - 1, currenty].pathF = grid[currentx - 1, currenty].pathH + grid[currentx - 1, currenty].pathG;
                }
            }

          [does the same as above but for one box to the left, one box to the top and one to the bottom in here... pretty much the same code so I've left it out...]


#region Find Minimum F value that's on an open grid box

            float minimumpathF = 0;
            Vector2 minimumvector = Vector2.Zero;

            for (int i = 0; i < searchedlistnumber; i++)
            {
                if (grid[(int)searchedlist.X, (int)searchedlist.Y].pathF < minimumpathF || minimumpathF == 0)
                {
                    if (grid[(int)searchedlist.X, (int)searchedlist.Y].closed == false)
                    {
                        minimumpathF = grid[(int)searchedlist.X, (int)searchedlist.Y].pathF;
                        minimumvector = new Vector2(searchedlist.X, searchedlist.Y);
                    }
                }
            }
#endregion

#region Move to smallest value F slot, if that's the target square then backtrack the parents of the tiles and add them to the total path
            currentx = (int)minimumvector.X;
            currenty = (int)minimumvector.Y;

            if (currentx == target.X && currenty == target.Y)
            {
                int aa = 0;
                bool atstart = false;
                while (atstart == false)
                {
                    path[aa] = grid[currentx, currenty].parenttile;
                    currentx = (int)path[aa].X;
                    currenty = (int)path[aa].Y;
                    if (path[aa] == startposition)
                    {
                        atstart = true;
                        pathlength = aa;
                    }
                    aa += 1;
                }
            }
            else
            {
                goto restart;
            }


        }
#endregion
    }
}



        protected override void Update(GameTime gameTime)
        {
            mouseState = Mouse.GetState();

     if (mouseState.LeftButton == ButtonState.Pressed)
            {

                if (mouseState.X > 100 && mouseState.X < 700)
                {
                    if (mouseState.Y > 100 && mouseState.Y < 500)
                    {
                        int currentx = ((mouseState.X - 100) - (mouseState.X - 100) % 20) / 20;
                        int currenty = ((mouseState.Y - 100) - (mouseState.Y - 100) % 20) / 20;
                        tiles[currentx, currenty].isblocked = true;
                        [updatedrawings]

                    }
                }
            }

            if (mouseState.RightButton == ButtonState.Pressed)
            {
                person = new SearchingObject();
                person.updatepath(tiles, new Vector2(2, 10), new Vector2(28, 10));
            }
}