//loop over all the neighbours of the current nodewhile(i-- > [[0]]){	//cN is the current neighbor that is being examined	cN = neighbours as DataTile;	//makes sure that cN.getCost() is multiplied by [[[1]]].[[[4]]] if this path is diagonalcN.setDiag(_map.isDiagonal(current.getPosition(), cN.getPosition()));					if(!cN.getOpen())	{		//add to open-array							openTile(cN, cN.getPosition(), current.getG(), this._end, current);	}	else	{		//already in open, check if F via current node is lower			newF = cN.calculateUpdateF(current.getG()); 		if(newF < cN.getF())		{			pos = this._heap.getPosition(cN);						cN.setParent(current);			cN.setG(current.getG());			this._heap.update_heap(pos);			}	}}

                /* Add all eight adjacent squares to the OPEN list */                for (int x = Curr->x - 1; x < Curr->x + 2; ++x)                {                        for (int y = Curr->y - 1; y < Curr->y + 2; ++y)                        {                                if (x == Curr->x && y == Curr->y)                                        continue;                                /* Ignore unwalkable squares */                                if (!IsUnwalkable(unwalkable, Point(x, y), Start))                                {                                        /* Find out if this square is already on the OPEN list */                                        std::map<int, Location*>::iterator item = List.find(LHASH(x, y));                                        Location* newloc = NULL;                                        /* If it is, we need to find out which is better, our new version, or the old version                                         */                                        if (item != List.end())                                        {                                                /* Replace it, if our G-score is better than the old one */                                                if (item->second->Open())                                                {                                                        if (item->second->GetG() > Curr->GetG() + (Cost(Curr->x, Curr->y, x, y)))                                                        {                                                                delete item->second;                                                                newloc = new Location(x, y, Curr);                                                        }                                                        else                                                                /* Keep it if the old square is better scored */                                                                continue;                                                }                                                else                                                        /* Item exists, but is in the closed list, we don't mess with it */                                                        continue;                                        }                                        else                                        {                                                /* Item is in neither open or closed list, add it to the OPEN list */                                                newloc = new Location(x, y, Curr);                                        }                                        /* For the new item we added (if we added one) set te G score and the H score.                                         * As above, G score is the cost to get to this square from the starting position,                                         * and the H score is the cost to get to this square from the END location ignoring                                         * unwalkables and travelling only horizontally and vertically.                                         */                                        newloc->SetG(Curr->GetG() + (Cost(Curr->x, Curr->y, x, y)));                                        newloc->SetH(End);                                        List[LHASH(x, y)] = newloc;                                }                        }                }