English
Related papers

Related papers: The 21 Card Trick and its Generalization

200 papers

Understanding videos such as TV series and movies requires analyzing who the characters are and what they are doing. We address the challenging problem of clustering face tracks based on their identity. Different from previous work in this…

Computer Vision and Pattern Recognition · Computer Science 2019-08-21 Makarand Tapaswi , Marc T. Law , Sanja Fidler

When we want to simulate the realization of a symmetric simple random walk on $\mathbb Z^d$, we use $(2d)$-side fair dice to decide to which neighbor it jumps at each step if $d\geq 2$ or we simply use a fair coin when $d=1$. Assume that…

In a game of permutation wordle, a player attempts to guess a secret permutation in the fewest number of guesses possible. Previously, Samuel Kutin and Lawren Smithline (arXiv:2408.00903) introduced this game and proposed a strategy called…

Combinatorics · Mathematics 2026-01-12 Aurora Hiveley

In multi-player card games such as Skat or Bridge, the early stages of the game, such as bidding, game selection, and initial card selection, are often more critical to the success of the play than refined middle- and end-game play. At the…

Artificial Intelligence · Computer Science 2025-12-18 Stefan Edelkamp

Many poker systems, whether created with heuristics or machine learning, rely on the probability of winning as a key input. However calculating the precise probability using combinatorics is an intractable problem, so instead we approximate…

Artificial Intelligence · Computer Science 2018-08-24 Brandon Da Silva

This paper investigates the cryptocurrency giveaway scam with the YouTube live stream carried out on 5/15/2022 and 5/16/2022. In this scam scheme, the scammer plays a recorded video of a famous person in a YouTube live stream annotated with…

Cryptography and Security · Computer Science 2023-02-01 Iman Vakilinia

In this paper we study a cooperative card game called Hanabi from the viewpoint of algorithmic combinatorial game theory. In Hanabi, each card has one among $c$ colors and a number between $1$ and $n$. The aim is to make, for each color, a…

Discrete Mathematics · Computer Science 2017-03-09 Jean-Francois Baffier , Man-Kwun Chiu , Yago Diez , Matias Korman , Valia Mitsou , André van Renssen , Marcel Roeloffzen , Yushi Uno

A transform that is universally polarizing over a set of channels with memory is presented. Memory may be present in both the input to the channel and the channel itself. Both the encoder and the decoder are aware of the input distribution,…

Information Theory · Computer Science 2024-09-13 Boaz Shuval , Ido Tal

While Poker, as a family of games, has been studied extensively in the last decades, collectible card games have seen relatively little attention. Only recently have we seen an agent that can compete with professional human players in…

Artificial Intelligence · Computer Science 2024-04-26 Radovan Haluska , Martin Schmid

Wordle is an online word puzzle game that gained viral popularity in January 2022. The goal is to guess a hidden five letter word. After each guess, the player gains information about whether the letters they guessed are present in the…

Computation and Language · Computer Science 2022-02-02 Benton J. Anderson , Jesse G. Meyer

In this paper we study random orderings of the integers with a certain invariance property. We describe all such orders in a simple way. We define and represent random shuffles of a countable set of labels and then give an interpretation of…

Probability · Mathematics 2007-05-23 Saul Jacka , Jon Warren

This paper concludes five years of AI competitions based on Legends of Code and Magic (LOCM), a small Collectible Card Game (CCG), designed with the goal of supporting research and algorithm development. The game was used in a number of…

Artificial Intelligence · Computer Science 2023-07-10 Jakub Kowalski , Radosław Miernik

We present an analysis of a coin-tossing problem posed by Daniel Litt which has generated some popular interest. We demonstrate a recursive identity which leads to relatively simple formulas for the excess number of wins for one player over…

Combinatorics · Mathematics 2025-12-09 Bruce Levin

This article, based on a talk, treats some elementary, but not completely simple examples from probability. They concern multiple birthday coincidences, throwing dice, the combinatorics of the German card game "Doppelkopf", and the…

History and Overview · Mathematics 2017-11-17 Edgar M. E. Wermuth

Guessing games for directed graphs were introduced by Riis for studying multiple unicast network coding problems. In a guessing game, the players toss generalised dice and can see some of the other outcomes depending on the structure of an…

Information Theory · Computer Science 2014-11-04 Rahil Baber , Demetres Christofides , Anh N. Dang , Søren Riis , Emil Vaughan

This paper presents a solution to the Knights and Spies Problem: In a room there are n people, each labelled with a unique number between 1 and n. A person may either be a knight or a spy. Knights always tell the truth, while spies may…

Combinatorics · Mathematics 2009-03-18 Mark Wildon

Popular musicians often learn music by ear. It is unclear what role technology plays for those with experience at this task. In search of opportunities for the development of novel human-recording interactions, we analyze 18 YouTube videos…

Human-Computer Interaction · Computer Science 2024-06-07 Christopher Liscio , Daniel G. Brown

Credit and debit cards, rather than actual money, have become the universal payment means. With these cards, it has become possible to buy expensive items easily without an additional complex authentication procedure being conducted.…

Cryptography and Security · Computer Science 2013-06-25 Chae Chang Lee , Ji Won yoon

Deep neural networks have shown promise in several domains, and the learned data (task) specific information is implicitly stored in the network parameters. Extraction and utilization of encoded knowledge representations are vital when data…

We investigate the expected number of calls required to achieve Bingo in a generalized (n,m)-Bingo game, where each n x n card is filled by sampling n numbers from m possible values per column. Using the inclusion-exclusion principle, we…

Combinatorics · Mathematics 2025-11-27 Vu Phan , Ilie Ugarcovici