On the Parallel Tower of Hanoi Puzzle: Acyclicity and a Conditional Triangle Inequality

07/13/2020

∙

A generalization of the Tower of Hanoi Puzzle—the Parallel Tower of Hanoi Puzzle–is described herein. Within this context, two theorems on minimal walks in the state space of configurations, along with their algorithmic proofs, are provided.

READ FULL TEXT

On the Parallel Tower of Hanoi Puzzle: Acyclicity and a Conditional Triangle Inequality

A New Inequality Related to Proofs of Strong Converse Theorems in Multiterminal Information Theory

A New Inequality Related to Proofs of Strong Converse Theorems for Source or Channel Networks

Proofs of two Theorems concerning Sparse Spacetime Constraints

Combinatorial proofs of two theorems of Lutz and Stull

KPynq: A Work-Efficient Triangle-Inequality based K-means on FPGA

State-Space Constraints Improve the Generalization of the Differentiable Neural Computer in some Algorithmic Tasks

Metrics and Ambits and Sprawls, Oh My

On the Parallel Tower of Hanoi Puzzle: Acyclicity and a Conditional Triangle Inequality

Related Research

A New Inequality Related to Proofs of Strong Converse Theorems in Multiterminal Information Theory

A New Inequality Related to Proofs of Strong Converse Theorems for Source or Channel Networks

Proofs of two Theorems concerning Sparse Spacetime Constraints

Combinatorial proofs of two theorems of Lutz and Stull

KPynq: A Work-Efficient Triangle-Inequality based K-means on FPGA

State-Space Constraints Improve the Generalization of the Differentiable Neural Computer in some Algorithmic Tasks

Metrics and Ambits and Sprawls, Oh My