Claude vs Gemini: Solving the laden knight's tour problem

Reddit r/artificial News

Summary

An AI coding contest compares Claude and Gemini on a weighted knight's tour problem variant where the cost of each move depends on accumulated load from visited squares.

[AI Coding contest day 8](https://boreal.social/post/ai-coding-contest-day-8-laden-knights-tour-speed-won-small) 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.
Original Article

Similar Articles

Gemini 3.1 Wins LLM Chess Tournament

Reddit r/singularity

This video builds a chess simulator and tests the reasoning abilities of multiple LLMs using puzzles and tournaments. Results show Gemini 3.1 wins, and there is a clear gap between open-source models and top closed-source models.