DeepAI AI Chat
Log In Sign Up

A Chain-Detection Algorithm for Two-Dimensional Grids

by   Paul Bonham, et al.

We describe a general method of detecting valid chains or links of pieces on a two-dimensional grid. Specifically, using the example of the chess variant known as Switch-Side Chain-Chess (SSCC). Presently, no foolproof method of detecting such chains in any given chess position is known and existing graph theory, to our knowledge, is unable to fully address this problem either. We therefore propose a solution implemented and tested using the C++ programming language. We have been unable to find an incorrect result and therefore offer it as the most viable solution thus far to the chain-detection problem in this chess variant. The algorithm is also scalable, in principle, to areas beyond two-dimensional grids such as 3D analysis and molecular chemistry.


page 3

page 5

page 9

page 24

page 25

page 26

page 27

page 28


Fast and Asymptotically Powerful Detection for Filamentary Objects in Digital Images

Given an inhomogeneous chain embedded in a noisy image, we consider the ...

Catching a fast robber on a grid

We consider a variant of Cops and Robbers in which the robber may traver...

Minimum bounded chains and minimum homologous chains in embedded simplicial complexes

We study two optimization problems on simplicial complexes with homology...

Chains, Koch Chains, and Point Sets with many Triangulations

We introduce the abstract notion of a chain, which is a sequence of n po...

Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs

We consider the irreducibility of switch-based Markov chains for the app...

Gray codes and symmetric chains

We consider the problem of constructing a cyclic listing of all bitstrin...

On-line Chain Partitioning Approach to Scheduling

An on-line chain partitioning algorithm receives the points of the poset...