Timeline for How to find all possible paths with specific length in hexagonal game board?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 9, 2018 at 7:30 | answer | added | Brad Buchanan | timeline score: 1 | |
| Mar 9, 2018 at 6:10 | comment | added | S.D. | If you forget the hexagons and just think the corners as vertices and sides as edges of a graph, then you can apply some of the existing graph traversal algorithms. Once the path is found, you can do another pass to select some hexagons that have the path segments as sides. | |
| Mar 8, 2018 at 14:03 | comment | added | candied_orange | Since you're saying the user can't re-enter a hex I presume you're only looking to light up possible final destinations when fully consuming the number rolled on the dice. Is this correct? | |
| Mar 8, 2018 at 13:55 | review | First posts | |||
| Mar 8, 2018 at 14:06 | |||||
| Mar 8, 2018 at 13:55 | answer | added | Kilian Foth | timeline score: 1 | |
| Mar 8, 2018 at 13:51 | history | asked | Lolo | CC BY-SA 3.0 |