Jul 21, 2022 · That's only about twice $100$. The nearest you could get to a square pattern would be $12$ by $18$. I haven't thought about arranging the $216$ combinations as hexagons or …

May 16, 2025 · I'm working on an ILP formulation that's supposed to find the best scoring set of routes on a given turn in a 18xx-style board game (in this particular case, Shikoku 1889) Problem …

For this graph, there is only a single such vertex, so your center in the single vertex labelled $3$ in the graph. You can see that the name center really is quite aptly named. The vertices of the center …

Sep 28, 2021 · About 7 years ago I was asked this question. I remembered it right now, and I can't solve it. Prove that no matter how you play, the game Hex will have a winner at the end.

6 days ago · Are you familiar with the probabilistic proof of Erdős's "high girth and high chromatic number" result? I don't know for certain that it will work, but a similar approach is the first thing I …

Jul 24, 2019 · The units are just steps through the grid, right? i.e.if I can only hop from the center of one hexagon to the center of an adjacent hexagon, you want to count the number of hops to get from one …

Mar 8, 2026 · Q&A for people studying math at any level and professionals in related fields

Mar 13, 2018 · Say I fill up the plane with regular hexagons whose side is distance 1, all packed together. Is there a formula or a pattern that gives all points? I let the $(0,0)$ be the center of the first …

Q&A for people studying math at any level and professionals in related fields

Aug 8, 2022 · The triangle $ABC$ is divided into sub-simplices in a non-trivial way (there exists at least one point on each of the segments $AB$, $AC$, $BC$ other than $A$, $B ...