相关论文: The (Final) countdown

We introduce SudoQ, a quantum version of the classical game Sudoku. Allowing the entries of the grid to be (non-commutative) projections instead of integers, the solution set of SudoQ puzzles can be much larger than in the classical…

The game of SET is a popular card game in which the objective is to form Sets using cards from a special deck. In this paper we study single- and multi-round variations of this game from the computational complexity point of view and…

The game of 2048 is a highly addictive game. It is easy to learn the game, but hard to master as the created game revealed that only about 1% games out of hundreds million ever played have been won. In this paper, we would like to explore…

The "Millennium Prize Problems" have a place in the history of mathematics. Here we tell some little-known anecdotes from the perspective of the planner of that project. These stories are far from their end; more likely they are just at…

Multi-round competitions often double or triple the points awarded in the final round, calling it a bonus, to maximize spectators' excitement. In a two-player competition with $n$ rounds, we aim to derive the optimal bonus size to maximize…

Chess and chance are seemingly strange bedfellows. Luck and/or randomness have no apparent role in move selection when the game is played at the highest levels. However, when competition is at the ultimate level, that of the World Chess…

The game of baccarat has evolved from a parlor game played by French aristocrats in the first half of the 19th century to a casino game that generated over US\$41 billion in revenue for the casinos of Macau in 2013. The parlor game was…

We present an end-to-end learning method for chess, relying on deep neural networks. Without any a priori knowledge, in particular without any knowledge regarding the rules of chess, a deep neural network is trained using a combination of…

In the Contention Resolution problem $n$ parties each wish to have exclusive use of a shared resource for one unit of time. The problem has been studied since the early 1970s, under a variety of assumptions on feedback given to the parties,…

The game of chess as always been viewed as an iconic representation of intellectual prowess. Since the very beginning of computer science, the challenge of being able to program a computer capable of playing chess and beating humans has…

The Tower of Hanoi game is a classical puzzle in recreational mathematics (Lucas 1883) which also has a strong record in pure mathematics. In a borderland between these two areas we find the characterization of the minimal number of moves,…

In this work we study the ranking algorithm used by F\'ed\'eration Internationale de Football Association (FIFA); we analyze the parameters it currently uses, show the formal probabilistic model from which it can be derived, and optimize…

Since many real-world problems arising in the fields of compiler optimisation, automated software engineering, formal proof systems, and so forth are equivalent to the Halting Problem--the most notorious undecidable problem--there is a…

Curiously overlooked in physics is its dependence on the transmission of numbers. For example the transmission of numerical clock readings is implicit in the concept of a coordinate system. The transmission of numbers and other logical…

A certain sampling process, concerning an urn with balls of two colors, proposed in 1965 by B.E. Oakley and R.L. Perry, and discussed by Peter Winkler and Martin Gardner, that has an extremely simple answer for the probability, namely the…

In this paper, some new criteria for detecting whether a finite game is potential are proposed by solving potential equations. The verification equations with the minimal number for checking a potential game are obtained for the first time.…

This paper explores the significant history of professional football and the betting industry, tracing its evolution from clandestine beginnings to a lucrative multi-million-pound enterprise. Initiated by the legalization of gambling in…

From sports to science, the recent availability of large-scale data has allowed to gain insights on the drivers of human innovation and success in a variety of domains. Here we quantify human performance in the popular game of chess by…

This paper revisits a classical problem of slotted multiple access with success, idle, and collision events on each slot. First, results of a 2-user multiple access game are reported. The game was conducted at the University of Southern…

Ultimate Tic-Tac-Toe is a variant of the popular Tic-Tac-Toe game. Two players compete to win three aligned "fields," with each field constituting its own miniature tic-tac-toe game. Each move determines which field the next player must…