faheygirlhey:

giovannuzza:

ominousbedroom:

dorkery:

thedankestmofo:

Fun Fact of the Day: In chess, the knight can visit each square exactly once.

That is ultra cool

The Knight’s Tour is a great example of a common problem in graph theory: finding Hamiltonian paths of a graph, a path where each vertex is visited only once.

The term graph here seems unfamiliar but it’s only because higher math makes things rigorous and well-defined for mathematicians to appear to know what the fuck they’re doing.

So the general definition of a graph is a set of interconnected objects, and a vertex is one of these objects in that set. So the chessboard is a graph and its squares (the vertices) are interconnected. Why? Only because the rules of chess make these interconnections real, and so makes this problem plausible. The gif actually represents only one solution out of a nice 13,267,364,410,532 paths.

………..

Just ignore me and my patronizing italics and enjoy the gif, it’s cool.

WAIT I NEED TO SAVE THIS BECAUSE THIS IS THE ONE PUZZLE IN DIABOLICAL BOX I NEVER FINISHED