# Solving “Knight Moves 6” (Jane Street Puzzle, October 2024)

**We will update this article after the official solution has been released to share our approach.**

*As usual, all opinions herein are solely our own and do not express the views or opinions of our employer.*

This puzzle is straightforward. As explained on the webpage, a 6x6 chessboard has squares labeled from A to C, corresponding to positive integers. The puzzle is solved by assigning values to A, B, and C and creating two corner-to-corner trips using knight’s moves so that each trip scores 2024. The method to calculate the score is: *(a)* moving between two *different* integers **multiplies** the score by the value the knight is moving to, and *(b)* moving between two *identical* integers **increments** the score with the value the knight is moving to. Last constraint: a square can only be visited once per trip (but a square does not necessarily have to be visited).

The official webpage distinguishes between optimal and trips which, while not optimal, are qualifying (*i.e.*, A + B + C < 50).

Because there is currently no official solution, we do not share ours yet. However, we would like to offer the following tips:

Optimal sum: A + B + C

**≪ 50**The total length of the shortest trips,

*when the sum is optimal*, is**≈ 30 moves**A submission seems to be identified as being optimal just because its sum A + B + C is, not because of the length of its trips. (We submitted the optimal sum, but, retrospectively, not the best pair of trips).

*(This article will be updated next month to share our approach to solving this puzzle).*