HexCell lowestFCell = FindLowestF(openList) įoreach (HexCell cell in lowestFCell.AdjacencyList) If openList count is ever 0, that means we've not found the shortest path PlayerH = Vector3.Distance(currentCellPos, targetCellPos) Var targetCellPos = selectedHex.Position Var closedList = new List() // When the target tile is added to the closed list, we are done Debug.Log('selected hex at ' + selectedHex.Position) Activate the corresponding highlight object for the tileĬellHighlightObjects.SetActive(!cellHighlightObjects.activeInHierarchy) Tilemap.SetTile(coordinate, tilebaseTest) Var index = ConvertPositionToHexCellIndex(coordinate) Vector3Int coordinate = grid.WorldToCell(mouseWorldPos) Vector3 mouseWorldPos = worldMinimapCamera.ScreenToWorldPoint(clickPosition) If (worldMinimapCamera != null & grid != null) Public void OnClick(Vector3 clickPosition) If (!cellHighlightObjects.ContainsKey(intPos)) Var intPos = Vector3Int.RoundToInt(position) Public void RegisterCellHighlightObject(Vector3 position, GameObject go) WorldMinimapCamera.targetTexture = minimapRawImageRenderTexture WorldMinimapCamera = worldMap.GetComponentInChildren() Var bottomPanel = Instantiate() īottomPanel.GetComponent().SetParent(, false) Private const float hexDimension = 0.8660254f private RenderTexture minimapRawImageRenderTexture These will change based on player position later, for now they're static at the origin: Private Dictionary cellHighlightObjects = new Dictionary() Private const float worldmapVerticalOffset = 100f

Private enum HexDirection = new Dictionary() I've got the following HexCell class that acts as a data container and adjacency finder using a hex index integer: namespace Expedition I'm attempting to implement the A* pathfinding algorithm for a 2d hexagonal tilemap.

Question marks on hexcells