Related papers: Generalizations of the Hanoi Towers Problem

The classical no-three-in-line problem is to find the maximum number of points that can be placed in the $n \times n$ grid so that no three points lie on a line. Given a set $S$ of points in an Euclidean plane, the General Position Subset…

The game of the Towers of Hanoi is generalized to binary trees. First, a straightforward solution of the game is discussed. Second, a shorter solution is presented, which is then shown to be optimal.

For the multi-peg Tower of Hanoi problem with $k \geqslant 4$ pegs, so far the best solution is obtained by the Stewart's algorithm based on the the following recurrence relation: $\mathrm{S}\_k(n)=\min\_{1 \leqslant t \leqslant n} \left\{2…

We prove that the solutions to the k-peg Tower of Hanoi Problem given by Frame and Stewart are minimal.

We study the classical game of peg solitaire when diagonal jumps are allowed. We prove that on many boards, one can begin from a full board with one peg missing, and finish with one peg anywhere on the board. We then consider the problem of…

We study a new reconfiguration problem inspired by classic mechanical puzzles: a colored token is placed on each vertex of a given graph; we are also given a set of distinguished cycles on the graph. We are tasked with rearranging the…

Inspired by a chessboard puzzle of Dudeney, the general position problem in graph theory asks for a largest set $S$ of vertices in a graph such that no three elements of $S$ lie on a common shortest path. The number of vertices in such a…

We present in this paper four new variants of the Tower of Hanoi problem, the optimal solution of each of these variants is related to one of the four known numbers Fibonacci, Lucas, Pell, and Jacobsthal. We give an optimal solution to each…

We consider Newton's problem of minimal resistance, in particular we address the problem arising in the limit if the height goes to infinity. We establish existence of solutions and lack radial symmetry of solutions. Moreover, we show that…

We consider the problem of determining the minimum number of moves needed to solve a certain one-dimensional peg puzzle. Let N be a positive integer. The puzzle apparatus consists of a block with a single row of 2N+1 equally spaced holes…

The aim of this work is to use Napoleon's Theorem in different regular polygons, and decide whether we can prove Napoleon's Theorem is only limited with triangles or it could be done in other regular polygons that can create regular…

In many problems in optimal control, one seeks to minimise an objective function subject to constraints on the velocity of the system. Imposing these constraints directly -- the ``hard-constrained'' approach -- is often analytically and…

We consider a series of optimal control problems with 2-dimensional control lying in an arbitrary convex compact set $\Omega$. The considered problems are well studied for the case when $\Omega$ is a unit disc, but barely studied for…

The cage problem concerns finding $(k,g)$-graphs, which are $k$-regular graphs with girth $g$, of the smallest possible number of vertices. The central goal is to determine $n(k,g)$, the minimum order of such a graph, and to identify…

Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex. We consider a variant of this classical problem in which the position of each…

We prove the first nontrivial worst-case lower bounds for two closely related problems. First, $\Omega(n^{3/2})$ degree-1 reductions, series-parallel reductions, and $\Delta$Y transformations are required in the worst case to reduce an…

The reasons which restrict opportunities of classical mechanics at the description of nonequilibrium systems are discussed. The way of overcoming of the key restrictions is offered. This way is based on an opportunity of representation of…

We study optimization problems for partially hinged rectangular plates, modeling bridge roadways, in the presence of real and artificial obstacles. Real obstacles represent structural constraints to avoid, while artificial ones are…

We consider a 3-parametric linear deformation of the Poisson brackets in classical mechanics. This deformation can be thought of as the classical limit of dynamics in so-called "quantized spaces". Our main result is a description of the…

Our idea is to imitate Smale's list of problems, in a restricted domain of mathematical aspects of Celestial Mechanics. All the problems are on the n-body problem, some with different homogeneity of the potential, addressing many aspects…