Hot answers tagged

1

In case anyone needs it, here's the C# implementation of Patel's algorithm: IEnumerable<Hex> GetRange(Hex center, int range) { var inRange = new List<Hex>(); for (int q = -range; q <= range; q++) { int r1 = Math.Max(-range, -q - range); int r2 = Math.Min(range, -q + range); for (...


Only top voted, non community-wiki answers of a minimum length are eligible