中文
相关论文

相关论文: Analysis of the picture cube puzzle

200 篇论文

How many moves does it take to solve Rubik's Cube? Positions are known that require 20 moves, and it has already been shown that there are no positions that require 27 or more moves; this is a surprisingly large gap. This paper describes a…

符号计算 · 计算机科学 2008-03-25 Tomas Rokicki

The Rubik's cube is a famous puzzle in which faces can be moved and the corresponding movement operations define a group. We consider here a generalization to any $3$-valent map. We prove an upper bound on the size of the corresponding…

组合数学 · 数学 2020-12-02 Mathieu Dutour Sikirić

We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a position that is adjacent to at least two other coins. The goal of…

离散数学 · 计算机科学 2007-05-23 Erik D. Demaine , Martin L. Demaine , Helena A. Verrill

Notes on the Spinpossible puzzle game. We give a mathematical description of the game, prove some elementary bounds on the length of optimal solutions, and consider variations of the game which place restrictions on the set of permitted…

组合数学 · 数学 2011-11-01 Alex Sutherland , Andrew Sutherland

Let $S$ be a connected graph which contains an induced path of $n-1$ vertices, where $n$ is the order of $S.$ We consider a puzzle on $S$. A configuration of the puzzle is simply an $n$-dimensional column vector over $\{0, 1\}$ with…

组合数学 · 数学 2009-10-30 Hau-wen Huang , Chih-wen Weng

We study a popular puzzle game known variously as Clickomania and Same Game. Basically, a rectangular grid of blocks is initially colored with some number of colors, and the player repeatedly removes a chosen connected monochromatic group…

计算复杂性 · 计算机科学 2007-05-23 Therese C. Biedl , Erik D. Demaine , Martin L. Demaine , Rudolf Fleischer , Lars Jacobsen , J. Ian Munro

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…

人工智能 · 计算机科学 2024-08-16 Shunyu Yao , Mitchy Lee

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…

组合数学 · 数学 2007-05-23 David M. Bradley , Hugh Thomas

We investigate a type of a Sudoku variant called Sudo-Kurve, which allows bent rows and columns, and develop a new, yet equivalent, variant we call a Sudo-Cube. We examine the total number of distinct solution grids for this type with or…

历史与综述 · 数学 2018-08-27 Tanya Khovanova , Wayne Zhao

We consider a puzzle such that a set of colored cubes is given as an instance. Each cube has unit length on each edge and its surface is colored so that what we call the Surface Color Condition is satisfied. Given a palette of six colors,…

离散数学 · 计算机科学 2015-12-04 Kazuya Haraguchi

How can we predict the difficulty of a Sudoku puzzle? We give an overview of difficulty rating metrics and evaluate them on extensive dataset on human problem solving (more then 1700 Sudoku puzzles, hundreds of solvers). The best results…

人工智能 · 计算机科学 2014-03-31 Radek Pelánek

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…

概率论 · 数学 2024-10-29 Yanlin Qu , Tomas Rokicki , Hillary Yang

The mathematical aspects of the popular logic game Sudoku incorporate a significant number of the group theory concepts. In this note, we describe all symmetric transformations of the Sudoku grid. We do not intend to obtain a new strategy…

群论 · 数学 2011-06-07 Vasiliy Osipov

We analyze Solo Chess puzzles, where the input is an $n \times n$ board containing some standard Chess pieces of the same color, and the goal is to make a sequence of capture moves to reduce down to a single piece. Prior work analyzes this…

计算复杂性 · 计算机科学 2023-02-06 Josh Brunner , Lily Chung , Michael Coulombe , Erik D. Demaine , Timothy Gomez , Jayson Lynch

Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…

计算复杂性 · 计算机科学 2009-09-25 Erik D. Demaine , Robert A. Hearn

In this lecture I will talk about three mathematical puzzles involving mathematics and computation that have preoccupied me over the years. The first puzzle is to understand the amazing success of the simplex algorithm for linear…

组合数学 · 数学 2018-01-09 Gil Kalai

"Bubble Ball" is a game built on a 2D physics engine, where a finite set of objects can modify the motion of a bubble-like ball. The objective is to choose the set and the initial configuration of the objects, in order to get the ball to…

系统与控制 · 电气工程与系统科学 2021-04-30 Hotae Lee , Monimoy Bujarbaruah , Francesco Borrelli

This paper studies sequential quantum games under the assumption that the moves of the players are drawn from groups and not just plain sets. The extra group structure makes possible to easily derive some very general results characterizing…

量子物理 · 物理学 2025-03-14 Theodore Andronikos

Various forms of sorting problems have been studied over the years. Recently, two kinds of sorting puzzle apps are popularized. In these puzzles, we are given a set of bins filled with colored units, balls or water, and some empty bins.…

A cube is an 8-rep-tile: it is the union of eight smaller copies of itself. Is there a set with a hole which has this property? The computer found an interesting and complicated solution, which then could be simplified. We discuss some…

度量几何 · 数学 2023-01-02 Christoph Bandt , Dmitry Mekhontsev
‹ 上一页 1 2 3 10 下一页 ›