Questions tagged [hexagonal-grid]
For challenges involving data on a hexagonal grid. Use this tag also for triangular grids, the dual of the hexagonal grid (that is, the vertices of the hexagonal grid form the faces of the triangular grid and vice versa).
68 questions
4 votes
3 answers
626 views
Draw a hex grid of a given size
Your task is to draw a requested number of cells in a flat-topped/pointy-sided hex pattern. Each cell is 5 characters high and 8 characters wide (4 characters wide at the top and bottom). This is a ...
- 8,076
21 votes
10 answers
4k views
Totally random Catan number distributions
I like to play (The Settlers of) Catan on Board Game Arena with totally random number tokens. These tokens determine the production rate of the terrain tiles beneath: There are 18 number tokens, two ...
- 4,749
21 votes
4 answers
1k views
Is this hexagon symmetric?
TLDR: This is the hexagonal version of Is this square symmetrical? Given a hexagonal grid, decide if it is symmetric. The shape of the grid is a regular hexagon. Each cell in the grid has two possible ...
- 51.9k
12 votes
9 answers
670 views
AoCG2021 Day 17: Langton's Hexa-Virus
The story continues from AoC2017 Day 22, Part 2. The damn virus that was infecting a grid computing cluster now has jumped to a hexagonal computing cluster! In this cluster, the computers are ...
- 79.3k
30 votes
6 answers
2k views
Stack the rocks
This is a rock: * Rocks can be stacked. Apart from the bottom-most layer, each rock must rest on two other rocks, like this: ...
- 46.2k
8 votes
4 answers
390 views
Hexagonal section numbers
Introduction Let's draw some regular hexagons formed by hexagonal tiles, marking the vertices of the tiles with dots. Then we will count the number of dots. ...
- 79.3k
22 votes
2 answers
1k views
Cut a triangle into equal-sized parts!
Similar in spirit to Number of distinct tilings of an n X n square with free n-polyominoes and Partition a square grid into parts of equal area, this challenge will have you count ways of partitioning ...
- 8,155
10 votes
10 answers
445 views
Counting shortest paths on a triangular grid
Background An Eisenstein integer is a complex number of the form \$ z = a + b\omega \$ where \$a, b\$ are integers and \$\omega\$ is the third root of unity \$\frac{1-\sqrt3i}{2}\$. The Eisenstein ...
- 79.3k