Skip to content

Instantly share code, notes, and snippets.

@wc
wc / Oh.txt
Last active October 14, 2017 06:42
Computes the number of unique Eulerian paths on the octahedron modulo octahedral rotations
[0, 1, 2, 3, 4, 5]
[0, 1, 4, 3, 2, 5]
[0, 2, 1, 4, 3, 5]
[0, 2, 3, 4, 1, 5]
[0, 3, 2, 1, 4, 5]
[0, 3, 4, 1, 2, 5]
[0, 4, 1, 2, 3, 5]
[0, 4, 3, 2, 1, 5]
[1, 0, 2, 5, 4, 3]
[1, 0, 4, 5, 2, 3]