Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[كتاب][B] Games, puzzles, and computation
RA Hearn, ED Demaine - 2009 - books.google.com
This book explores the underlying mathematical reasons for why games and puzzles are
challenging and so much fun. It shows how games and puzzles can serve as powerful …
challenging and so much fun. It shows how games and puzzles can serve as powerful …
Playing games with algorithms: Algorithmic combinatorial game theory
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 …
complexity theory, many of which remain open. The purpose of this paper is to provide an …
Rolling block mazes are PSPACE-complete
In a rolling block maze, one or more blocks lie on a rectangular board with square cells. In
most mazes, the blocks have size k X m X n where k, m, n are integers that determine the …
most mazes, the blocks have size k X m X n where k, m, n are integers that determine the …
Efficient algorithm for box folding
For a given polygon P and a polyhedron Q, the folding problem asks if Q can be obtained
from P by folding it. This simple problem is quite complicated, and there is no known efficient …
from P by folding it. This simple problem is quite complicated, and there is no known efficient …
On the complexity of rolling block and Alice mazes
We investigate the computational complexity of two maze problems, namely rolling block
and Alice mazes. Simply speaking, in the former game one has to roll blocks through a …
and Alice mazes. Simply speaking, in the former game one has to roll blocks through a …
Efficient algorithm for box folding
For a given polygon $ P $ and a polyhedron $ Q $, the folding problem asks if $ Q $ can be
obtained from $ P $ by folding it. This simple problem is quite complicated, and there is no …
obtained from $ P $ by folding it. This simple problem is quite complicated, and there is no …
Discrete Path Planning for Convex Polyhedra through Edge-Rolling on a Plane
NT Lam - 2022 - espace.curtin.edu.au
This thesis solved the path-planning problem of the Platonic solids and truncated
icosahedron through edge-rolling on a plane with obstacle avoidance, which hitherto had …
icosahedron through edge-rolling on a plane with obstacle avoidance, which hitherto had …
Gourds: A sliding-block puzzle with turning
We propose a new kind of sliding-block puzzle, called Gourds, where the objective is to
rearrange 1 x 2 pieces on a hexagonal grid board of 2n+ 1 cells with n pieces, using sliding …
rearrange 1 x 2 pieces on a hexagonal grid board of 2n+ 1 cells with n pieces, using sliding …
Rolling Polyhedra on Tessellations
We study the space reachable by rolling a 3D convex polyhedron on a 2D periodic
tessellation in the xy-plane, where at every step a face of the polyhedron must coincide …
tessellation in the xy-plane, where at every step a face of the polyhedron must coincide …
8 面, 20 面ダイスを用いた Rolling Dice Puzzle の NP 完全性
上嶋章宏， 岡田貴裕 - 電子情報通信学会論文誌 A, 2011 - search.ieice.org
本論文では, 格子盤面上でダイスを回転移動させることで, ある目的を達成できるかを問う Rolling
Cube Puzzle を拡張した問題について, その計算複雑さを議論する. 6 面ダイスと四角格子で定義 …
Cube Puzzle を拡張した問題について, その計算複雑さを議論する. 6 面ダイスと四角格子で定義 …