226 lines
7.1 KiB
C#
226 lines
7.1 KiB
C#
using System.Collections.Generic;
|
|
using System.Linq;
|
|
using Units;
|
|
using UnityEngine.SceneManagement;
|
|
using Object = UnityEngine.Object;
|
|
using Random = UnityEngine.Random;
|
|
|
|
namespace HexFiled
|
|
{
|
|
public class PaintedController
|
|
{
|
|
|
|
private HexCell _cell;
|
|
|
|
public PaintedController()
|
|
{
|
|
HexManager.UnitCurrentCell = new Dictionary<UnitColor, (HexCell cell, Unit unit)>();
|
|
}
|
|
|
|
public void PaintOnDeath(Unit unit)
|
|
{
|
|
HexManager.PaintHexList(HexManager.CellByColor[unit.Color], UnitColor.Grey);
|
|
// #if UNITY_EDITOR
|
|
//
|
|
//
|
|
// if (HexManager.UnitCurrentCell.Count == 1)
|
|
// {
|
|
// SceneManager.LoadScene(1);
|
|
// }
|
|
// #endif
|
|
}
|
|
public void CheckDeathOrDestroy(HexCell cell)
|
|
{
|
|
HexManager.UnitCurrentCell
|
|
.Where(cells
|
|
=> HexManager.CellByColor[cells.Key].Count < 3
|
|
|| (cells.Value.cell == cell && cells.Value.unit.Color != cell.Color))
|
|
.Select(cells => cells.Value.unit)
|
|
.ToList().ForEach(x => x.Death());
|
|
|
|
if (cell.Building != null)
|
|
{
|
|
Object.Destroy(cell.Building);
|
|
}
|
|
|
|
if (cell.Item != null)
|
|
{
|
|
cell.Item.Despawn();
|
|
}
|
|
}
|
|
public void SetHexColors(HexCell cell)
|
|
{
|
|
_cell = cell;
|
|
|
|
|
|
var hexByColorDict = DifferentHexByColor(cell.GetListNeighbours());
|
|
foreach (var item in hexByColorDict)
|
|
{
|
|
if (item.Key == cell.Color && item.Value.Count >= 2 && item.Value.Count < 6 &&
|
|
HexManager.UnitCurrentCell.ContainsKey(cell.Color))
|
|
{
|
|
|
|
cell.GetListNeighbours().ForEach(x =>
|
|
{
|
|
if (x != null && x.Color != cell.Color)
|
|
{
|
|
var path = Round(x, null);
|
|
if(!path.hasPath)
|
|
HexManager.PaintHexList(path.field, cell.Color, 0.05f);
|
|
}
|
|
});
|
|
}
|
|
|
|
if (item.Value.Count >= 2 && item.Key != UnitColor.Grey && item.Key != cell.Color)
|
|
{
|
|
item.Value.ForEach(neighbour =>
|
|
{
|
|
if (!HexManager.UnitCurrentCell.TryGetValue(neighbour.Color, out var value))
|
|
{
|
|
return;
|
|
}
|
|
var (hasPath, field) = HasPath(neighbour, HexManager.UnitCurrentCell[neighbour.Color].cell);
|
|
if (!hasPath)
|
|
{
|
|
field.ForEach(x => x.PaintHex(UnitColor.Grey));
|
|
}
|
|
});
|
|
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
private Dictionary<UnitColor, List<HexCell>> DifferentHexByColor(List<HexCell> cellsList)
|
|
{
|
|
Dictionary<UnitColor, List<HexCell>> resultDict = new Dictionary<UnitColor, List<HexCell>>();
|
|
cellsList.ForEach(cell =>
|
|
{
|
|
if (cell != null && resultDict.ContainsKey(cell.Color))
|
|
{
|
|
resultDict[cell.Color].Add(cell);
|
|
}
|
|
else if (cell != null)
|
|
{
|
|
resultDict.Add(cell.Color, new List<HexCell> { cell });
|
|
}
|
|
});
|
|
return resultDict;
|
|
}
|
|
|
|
private (bool hasPath, List<HexCell> field) Round(HexCell start, HexCell end)
|
|
{
|
|
if (start == null || start.Color == _cell.Color)
|
|
{
|
|
return (true, null);
|
|
}
|
|
|
|
List<HexCell> closedList = new List<HexCell>();
|
|
HexCell currentCell = start;
|
|
|
|
Stack<HexCell> stackIterators = new Stack<HexCell>();
|
|
stackIterators.Push(currentCell);
|
|
|
|
closedList.Add(currentCell);
|
|
|
|
while (stackIterators.Count >= 0)
|
|
{
|
|
if (end != null && currentCell == end)
|
|
return (true, closedList);
|
|
|
|
List<HexCell> openList = new List<HexCell>();
|
|
|
|
foreach (var neighbour in currentCell.GetListNeighbours())
|
|
{
|
|
if (neighbour == null)
|
|
{
|
|
return (true, null);
|
|
}
|
|
|
|
if (closedList.Contains(neighbour) || neighbour.Color == _cell.Color) continue;
|
|
openList.Add(neighbour);
|
|
if (neighbour.GetListNeighbours().Contains(end))
|
|
{
|
|
return (true, null);
|
|
}
|
|
}
|
|
|
|
if (openList.Count > 0)
|
|
{
|
|
currentCell = openList[Random.Range(0, openList.Count - 1)];
|
|
closedList.Add(currentCell);
|
|
stackIterators.Push(currentCell);
|
|
}
|
|
else
|
|
{
|
|
if (stackIterators.Count == 0)
|
|
{
|
|
return (false, closedList);
|
|
}
|
|
|
|
currentCell = stackIterators.Pop();
|
|
}
|
|
|
|
if (currentCell.GetListNeighbours().Contains(end))
|
|
{
|
|
return (true, null);
|
|
}
|
|
}
|
|
|
|
return (false, closedList);
|
|
}
|
|
|
|
private ( bool hasPath, List<HexCell> field ) HasPath(HexCell start, HexCell end)
|
|
{
|
|
if (start.Color == _cell.Color || end.Color == _cell.Color)
|
|
{
|
|
return (true, null);
|
|
}
|
|
|
|
List<HexCell> closedList = new List<HexCell>();
|
|
HexCell currentCell = start;
|
|
|
|
Stack<HexCell> stackIterators = new Stack<HexCell>();
|
|
stackIterators.Push(currentCell);
|
|
|
|
closedList.Add(currentCell);
|
|
|
|
|
|
while (stackIterators.Count >= 0)
|
|
{
|
|
if (currentCell == end)
|
|
return (true, null);
|
|
|
|
List<HexCell> openList = currentCell.GetListNeighbours()
|
|
.Where(neighbour => neighbour != null && !closedList.Contains(neighbour) && neighbour.Color == start.Color)
|
|
.ToList();
|
|
|
|
|
|
if (openList.Count > 0)
|
|
{
|
|
currentCell = openList[Random.Range(0, openList.Count - 1)];
|
|
closedList.Add(currentCell);
|
|
stackIterators.Push(currentCell);
|
|
}
|
|
else
|
|
{
|
|
if (stackIterators.Count == 0)
|
|
{
|
|
return (false, closedList);
|
|
}
|
|
|
|
currentCell = stackIterators.Pop();
|
|
}
|
|
|
|
if (currentCell.GetListNeighbours().Contains(end))
|
|
{
|
|
return (true, null);
|
|
}
|
|
}
|
|
|
|
return (false, closedList);
|
|
}
|
|
}
|
|
} |