相关论文: The Chaos Within Sudoku

The dynamics of a nonequilibrium system can become complex because the system has many components (e.g., a human brain), because the system is strongly driven from equilibrium (e.g., large Reynolds-number flows), or because the system…

It has been shown that any 9 by 9 Sudoku puzzle must contain at least 17 clues to have a unique solution. This paper investigates the more specific question: given a particular completed Sudoku grid, what is the minimum number of clues in…

Many dynamical systems operate in a fluctuating environment. However, even in low-dimensional setups, transitions and bifurcations have not yet been fully understood. In this Letter we focus on crises, a sudden flooding of the phase space…

The topological (resp. geodesic) complexity of a topological (resp. metric) space is roughly the smallest number of continuous rules required to choose paths (resp. shortest paths) between any points of the space. We prove that the geodesic…

We propose a new diagnostic for quantum chaos. We show that time evolution of complexity for a particular type of target state can provide equivalent information about the classical Lyapunov exponent and scrambling time as out-of-time-order…

We investigate the spread complexity of a generic two-level subsystem of a larger system to analyze the influence of energy level statistics, comparing chaotic and integrable systems. Initially focusing on the nearest-neighbor level…

We introduce higher-dimensional cubical sliding puzzles that are inspired by the classical 15 Puzzle from the 1880s. In our puzzles, on a $d$-dimensional cube, a labeled token can be slid from one vertex to another if it is topologically…

In this review article, we discuss connections between the physics of disordered systems, phase transitions in inference problems, and computational hardness. We introduce two models representing the behavior of glassy systems, the spiked…

In this paper, we consider different classes of subshifts and study their perturbations obtained by forbidding sequences that contain a given word as a subword. We show that the perturbations of sofic shifts are sofic. Though not true for…

Boolean satisfiability [1] (k-SAT) is one of the most studied optimization problems, as an efficient (that is, polynomial-time) solution to k-SAT (for $k\geq 3$) implies efficient solutions to a large number of hard optimization problems…

In a simple pattern matching problem one has a pattern $w$ and a text $t$, which are words over a finite alphabet $\Sigma$. One may ask whether $w$ occurs in $t$, and if so, where? More generally, we may have a set $P$ of patterns and a set…

Cognitive science and theoretical computer science both seek to classify and explain the difficulty of tasks. Mechanisms of intelligence are those that reduce task difficulty. Here we map concepts from the computational complexity of a…

Patterns of wins and losses in pairwise contests, such as occur in sports and games, consumer research and paired comparison studies, and human and animal social hierarchies, are commonly analyzed using probabilistic models that allow one…

We present a number of second order maps, which pass the singularity confinement test commonly used to identify integrable discrete systems, but which nevertheless are non-integrable. As a more sensitive integrability test, we propose the…

Sudoku puzzles can be formulated and solved as a sparse linear system of equations. This problem is a very useful example for the Compressive Sensing (CS) theoretical study. In this study, the equivalence of Sudoku puzzles L0 and L1…

Tablut is a complete-knowledge, deterministic, and asymmetric board game, which has not been solved nor properly studied yet. In this work, its rules and characteristics are presented, then a study on its complexity is reported. An upper…

We consider a family of singular maps as an example of a simple model of dynamical systems exhibiting the property of robust chaos on a well defined range of parameters. Critical boundaries separating the region of robust chaos from the…

We address the problem of the relative importance of the intrinsic chaos and the external noise in determining the complexity of population dynamics. We use a recently proposed method for studying the complexity of nonlinear random…

In order to simulate observational and experimental situations, we consider a leak in the phase space of a chaotic dynamical system. We obtain an expression for the escape rate of the survival probability applying the theory of transient…

We consider generalizations of the familiar fifteen-piece sliding puzzle on the 4 by 4 square grid. On larger grids with more pieces and more holes, asymptotically how fast can we move the puzzle into the solved state? We also give a…