How do I represent a hextile/hex grid in memory?
Say I'm building a board game with a hextile grid, like Settlers of Catan:
Note that each vertex and edge may have an attribute (a road and settlement above).
How would I make a data structure which represents this board? What are the patterns for accessing each tile's neighbors, edges and vertices?
Solution
Amit Patel has posted an amazing page on this topic. It's so comprehensive and wonderful that it needs to be the definitive answer to this question: Hexagonal Grids
- Issue with incompatible pointer type
- is FILO always LIFO?
- Does the type information of an object also take up space in memory?
- How do I represent a hextile/hex grid in memory?
- game of stacks in which number is removed from top until it amounts to greater that given max sum
- How to implement complete binary in c++?
- Can I represent a red black tree as an array?
- Kruskal's Algorithm Minimum Spanning Tree (Disjoint Set data structure)
- Is there a way to initialize a SortedMap<Integer, String> with values already included in Java?
- One or Two Primary Keys in Many-to-Many Table?
- How to add element into ArrayList in HashMap
- LinkedList remove method
- Convert a json into a list of tuples
- How to get top 3 tuples from two lists based on a sorting by float and string values
- Implementation of priority queue by AVL Tree data structure
- How can I store ids in Python without paying the 28-byte-per-int price?
- Solving Range Minimum Queries using Binary Indexed Trees (Fenwick Trees)
- Why does calling two functions in a single statement not affect the value?
- Find the max value of the same length nails after hammered
- How to sort a list of dictionaries by a value of the dictionary in Python?
- Getting Wrong Answer in "Binary Tree Cameras" LeetCode Hard
- Why is it better to have 100 functions operate on one data structure than 10 functions on 10 data structure
- How to build a nested adjacency list from an adjacency list and a hierarchy?
- Optimal implementation of a bijective mapping on a large scale
- shared red black tree among processes
- How to know if init operation of empty data structure costs us O(1) or more? (on general)
- Use Set.Make.iter to transform the elements of a set?
- How to create a B+ Tree data-structure
- Wrong output with dynamic programming on Limited Subway Surfer challenge
- python how to implement a list into a tree?