@abakcus

@abakcus Those 1980s kids who liked typing machine code programs direct from the pages of a magazine would know this already!

@abakcus @outis169 😮

@abakcus 👆🤩

@abakcus I would appreciate more if the solution walks in a symmetric pattern

@abakcus All in one game?

@abakcus Is there another solution that forms a cycle? i.e. one where the knight hopping from the end to the starting position is also a legal move

@abakcus Incidentally, it depends on the parity of the number of squares in the side, for a general nxn grid. For example, in a 3x3 grid you can only hop around the outer ring, but never into the central square.

@abakcus Lol

@abakcus How did the knight get to starting point?

@abakcus Doing this knight walk before winning could be the new bong cloud

@abakcus But... the knight does not start on that square, but two more to the right side. This way he can visit all the squares, but some of them more than once (to reach the starting point shown here).

@abakcus

@abakcus Does the starting square make any difference?

@abakcus Probably the question is easier than I imagine at this point but too lazy to think about this: is this path unique?

@abakcus Interesting...

@abakcus @stefanomammola1

@abakcus This is an interesting path where a knight can visit each square on a chessboard exactly once by excluding squares that had already visited. It will be more interesting if this happens irrelevant the starting point.

@abakcus the king, queen and castle can do this to... ...and so can the pawns !

@abakcus Now show me a game where the knight played this!