Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.18276

Optimal Strategies to Catch Randomly Walking Cat

Rüdiger Jehn
View original source ↗Read source document ↗Export metadata ↓

Abstract

The optimal strategies to catch a randomly walking cat in various environments are presented. All games have a player that opens a box at step $i$. If the cat is in this box the player wins, if not, the cat moves randomly to an adjacent box, or in case the box is open to the outside, the cat may escape. If the cat is not escaping, the next step of the game is played. In case the cat has doors to escape, the optimal strategy is determined that minimizes the escape chances of the cat. If there are no doors to the outside, the strategies are calculated that minimize the game duration. The environments are 1) a one-dimensional array of up to 9 boxes in a line 2) this line is connected to a ring and 3) a $2 \times m$ grid (with $2\le m\le 4$) of boxes. In cases 1) and 3) the boxes may or may not have exits to the outside. Numerical proofs for the optimality of the presented strategies are outlined. Also a formula is presented for the average number of steps it takes a randomly walking cat to exit a $2\times m$ grid when no player is involved. This formula is only based on Fibonacci numbers if $m$ is even and Lucas numbers if $m$ is odd.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Rüdiger Jehn. 2025-08-08. Optimal Strategies to Catch Randomly Walking Cat. https://arxiv.org/abs/2508.18276

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗