 | The eighth challenge is a weighted variant of the classic knight's tour. The knight must visit every square of a rectangular board exactly once, but each square carries an integer weight. As it moves, the knight accumulates load, and the cost of each move equals its current load. Charge is assessed upon departure, so the weight of the final square never contributes. [link] [comments] |
Claude vs Gemini: Solving the laden knight's tour problem
Reddit r/artificial / 4/19/2026
💬 OpinionIdeas & Deep AnalysisTools & Practical UsageModels & Research
Key Points
- The article describes the “laden knight’s tour” as a weighted variant of the classic knight’s tour problem, where a knight must visit every square exactly once on a rectangular board.
- Each square has an integer weight, and the move cost is defined as the knight’s current accumulated load when moving.
- Charges are assessed upon departure from a square, so the weight of the final square visited does not contribute to the total cost.
- The piece is framed as an AI-coding-contest Day 8 challenge comparing approaches from Claude and Gemini to solve this optimization-style problem.
