Related papers: Magic Tours of Knight in 4x4x4 Cube
We study 4-by-4 squares formed by cards from the EvenQuads deck. EvenQuads is a card game with 64 cards where cards have 3 attributes with 4 values in each attribute. A quad is four cards with all attributes the same, all different, or half…
We present an exact method for counting semi-magic squares of order 6. Some theoretical investigations about the number of them and a probabilistic method are presented. Our calculations show that there are exactly…
Rubik's Revenge, a 4x4x4 variant of the Rubik's puzzles, remains to date as an unsolved puzzle. That is to say, we do not have a method or successful categorization to optimally solve every one of its approximately $7.401 \times 10^{45}$…
New algorithms for generating closed knight's tours are obtained by generating a vertex-disjoint cycle cover of the knight's graph and joining the resulting cycles. It is shown experimentally that these algorithms are significantly faster…
In this paper we give a mathematical model for a game that we call picture cube puzzle and investigate its properties. The central question is the number of moves required to solve the puzzle. A mathematical discussion is followed by the…
Using a quartic surface and its rational curves we can give an infinite number of integer hexahedra; these are 6 sided 3d solids, each face a trapezoid, with all sides and diagonals having intger lengths.
In this experimental work we study billiard trajectories in triangular pyramids and try to establish conditions that guarantee the existence (or absence) of 4-cycles (there can be not more, than three of them). We formulate conjectures and…
We prove that the maximal number of conics, a priori irreducible of reducible, on a smooth spatial quartic surface is 800, realized by a unique quartic. We also classify quartics with many (at least 720) conics. The maximal number of real…
Intriguing symmetries are uncovered regarding all magic squares of orders 3, 4, and 5, with 1, 880, and 275,305,224 distinct configurations, respectively. In analogy with the travelling salesman problem, the distributions of the total…
The Rubix Cube is a 3-dimensional single-player combination puzzle attracting attention in the reinforcement learning community. A Rubix Cube has six faces and twelve possible actions, leading to a small and unconstrained action space and a…
We define a magic square to be a square matrix whose entries are nonnegative integers and whose rows, columns, and main diagonals sum up to the same number. We prove structural results for the number of such squares as a function of the…
Scrambling the standard 3x3x3 Rubik's Cube corresponds to a random walk on a group containing approximately 43 quintillion elements. Viewing the random walk as a Markov chain, its mixing time determines the number of random moves required…
We show that in any subset of the vertices of $n$-dimensional cube that contains at least $2^{n-1}+1$ vertices ($n\geq 4$), there are four vertices that induce a claw, or there are eight vertices that induce the cycle of length eight.
We give coordinate-minimal geometric realizations in general position of all 865 vertex-minimal triangulations of the orientable surface of genus 2 in the 4x4x4-cube.
We investigate a version of Waring's Problem over quaternion rings, focusing on cubes in quaternion rings with integer coefficients. We determine the global upper and lower bounds for the number of cubes necessary to represent all such…
We give a variety of magic hexagons of Orders from 3 to 7, many of which are extensions of known results. We also give a theorem that their are an infinite number of magic hexagons of Order $n$ for any fixed positive integer $n$ for any…
The present paper aims to extend the knight's tour problem for $k$-dimensional grids of the form $\{0,1\}^k$ to other fairy chess leapers. Accordingly, we constructively show the existence of closed tours in $2 \times 2 \times \cdots \times…
Two algorithms for construction of all closed knight's paths of lengths up to 16 are presented. An approach for classification (up to equivalence) of all such paths is considered. By applying the construction algorithms and classification…
It is conjectured that every integer N>454 is the sum of seven nonnegative cubes. We prove the conjecture when N is a multiple of 4.
Finding the number 2H6 of directed Hamiltonian cycles in 6-cube is problem 43 in Section 7.2.1.1 of Knuth's ' The Art of Computer Programming'; various proposed estimates are surveyed below. We computed exact value:…