Tag: 2018

Posted on

Tile Pattern-Building Games on a Grid are PSPACE-complete

Tile Pattern-Building Games on a Grid are PSPACE-complete (Short Abstract).

Angel A. Cantu, Arturo Gonzalez, Cesar Lozano, Austin Luchsinger, Eduardo Medina, Fernando Martinez, Arnoldo Ramirez, and Tim Wylie.
The 21st Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3’18), 2018.

Abstract: In this paper, we investigate a certain class of tile-based pattern games through a simplified version of a recent game titled Nonads. We prove that Nonads is PSPACE-complete with a reduction from bounded 2-player constraint logic (Bounded 2CL) even when both players share the same target and there is only one type of playable tile. This has application to any grid-based pattern building game.

Bibtex:

Posted on

Freezing Simulates Non-freezing Tile Automata

Title: Freezing Simulates Non-freezing Tile Automata

Authors: Cameron Chalk, Austin Luchsinger, Eric Martinez, Robert Schweller, Andrew Winslow, and Tim Wylie
Abstract:

Citation: Proc. of 24th Inter. Conf. on DNA Computing and Molecular Programming (DNA’18)
Bibtex:
PDF:

Posted on

Optimal Staged Self-Assembly of Linear Assemblies

Title: Optimal Staged Self-Assembly of Linear Assemblies
Authors: Cameron Chalk, Eric Martinez, Robert Schweller, Luis Vega, Andrew Winslow, Tim Wylie
Abstract:
We analyze the complexity of building linear assemblies, sets of linear assemblies, and $\mathcal{O}(1)$-scale general shapes in the staged tile assembly model. For systems with at most $b$ bins and $t$ tile types, we prove that the minimum number of stages to uniquely assemble a $1 \times n$ \emph{line} is $\Theta(\log_t{n} + \log_b{\frac{n}{t}} + 1)$. Generalizing to $\BO{1} \times n$ lines, we prove the minimum number of stages is $\BO{\frac{\log{n} – tb – t\log t}{b^2} + \frac{\log \log b}{\log t}}$ and $\Omega(\frac{\log{n} – tb – t\log t}{b^2})$. We also obtain similar upper and lower bounds in a model permitting \emph{flexible glues} using non-diagonal glue functions.

Next, we consider assembling sets of lines and general shapes using $t = \BO{1}$ tile types. We prove that the minimum number of stages needed to assemble a set of $k$ lines of size at most $\BO{1} \times n$ is $\BO{\frac{k\log n}{b^2}+\frac{k\sqrt{\log n}}{b}+\log\log n}$ and $\Omega(\frac{k\log n}{b^2})$. In the case that $b = \BO{\sqrt{k}}$, the minimum number of stages is $\Theta(\log{n})$. The upper bound in this special case is then used to assemble “hefty” shapes of at least logarithmic edge-length-to-edge-count ratio at $\BO{1}$-scale using $\BO{\sqrt{k}}$ bins and optimal $\BO{\log{n}}$ stages.

Citation: Proc. of 17th Inter. Conf. on Unconventional Computation and Natural Computation (UCNC’18)
Bibtex:

Posted on

Self-Assembly of Shapes at Constant Scale using Repulsive Forces

Self-Assembly of Shapes at Constant Scale using Repulsive Forces.
Austin Luchsinger, Robert Schweller, and Tim Wylie. In Natural Computing. 2018.

Link: https://link.springer.com/article/10.1007/s11047-018-9707-9

Abstract:

Bibtex:

 

Conference Version:

Self-Assembly of Shapes at Constant Scale using Repulsive Forces.
Austin Luchsinger, Robert Schweller, and Tim Wylie.
In Proc. of the 16th Inter. Conf. on Unconventional Computation and Natural Computation (UCNC’17), 2017.

Abstract:

Bibtex:

Posted on

Optimal Staged Self-Assembly of General Shapes

Title: Optimal Staged Self-Assembly of General Shapes
Authors: Cameron Chalk, Eric Martinez, Robert Schweller, Luis Vega, Andrew Winslow, Tim Wylie
Abstract:
We analyze the number of tile types t, bins b, and stages necessary to assemble \(n \times n\) squares and scaled shapes in the staged tile assembly model. For \(n \times n\) squares, we prove \(\mathcal {O}\left( \frac{\log {n} – tb – t\log t}{b^2} + \frac{\log \log b}{\log t}\right) \) stages suffice and \(\varOmega \left( \frac{\log {n} – tb – t\log t}{b^2}\right) \) are necessary for almost all n. For shapes S with Kolmogorov complexity K(S), we prove \(\mathcal {O}\left( \frac{K(S) – tb – t\log t}{b^2} + \frac{\log \log b}{\log t}\right) \) stages suffice and \(\varOmega \left( \frac{K(S) – tb – t\log t}{b^2}\right) \) are necessary to assemble a scaled version of S, for almost all S. We obtain similarly tight bounds when the more powerful flexible glues are permitted.
Published: Arxiv, European Symposium on Algorithms (ESA’16), Algorithmica

URL: https://link.springer.com/article/10.1007/s00453-017-0318-0

Journal Citation: Algorithmica, 80(4), 1383-1409, 2018.

Bibtex:
@article{CMSVWW:2018:Algorithmica,
author=”Chalk, Cameron and Martinez, Eric and Schweller, Robert and Vega, Luis and Winslow, Andrew and Wylie, Tim”,
title=”Optimal Staged Self-Assembly of General Shapes”,
journal=”Algorithmica”,
year=”2018″,
month=”Apr”,
day=”01″,
volume=”80″,
number=”4″,
pages=”1383–1409″,
issn=”1432-0541″,
doi=”10.1007/s00453-017-0318-0″,
url=”https://doi.org/10.1007/s00453-017-0318-0″
}

Conference Citation: Proceedings of the 24th European Symposium of Algorithms (ESA’16), 57, 26:1–26:17, 2016.