### A Short Note on Improved Logic Circuits in a Hexagonal Minesweeper

**2016-02-01**

1602.00398 | cs.CC

This paper aims to present an advanced version of PP-hardness proof of
Minesweeper by Bondt. The advancement includes improved Minesweeper
configurations for 'logic circuits' in a hexagonal Minesweeper. To do so, I
demonstrate logical uncertainty in Minesweeper, which ironically allows a
possibility to make some Boolean operators.
The fact that existing hexagonal logic circuits did not clearly distinguish
the true and false signal needs an improved form of a hexagonal wire. I
introduce new forms of logic circuits such as NOT, AND, OR gates, a curve and a
splitter of wires. Moreover, these new logic circuits complement Bondt's proof
for PP-hardness of Minesweeper by giving a new figure.

**Login to like/save this paper, take notes and configure your recommendations**

# Related Articles

**2019-04-05**

1904.03294 | cs.ET

Crosstalk computing, involving engineered interference between nanoscale
metal lines, offers a fresh… show more

**2018-10-12**

1810.05603 | cs.CC

We consider the power of Boolean circuits with MOD$_{6}$ gates. First, we
introduce a few basic noti… show more

**2018-09-29**

1810.00129 | cs.ET

IBM has made several quantum computers available to researchers around the
world via cloud services.… show more

**2018-12-11**

1812.04458 | quant-ph

Quantum hardware continues to advance, yet finding new quantum algorithms -
quantum software - remai… show more

**2018-11-07**

1811.02782 | cs.AI

This article deals with the problem of the uncertainty in rule-based systems
(RBS), but from the per… show more

**2016-09-16**

1609.05136 | cs.GT

We study the consensus-halving problem of dividing an object into two
portions, such that each of $n… show more

**2018-07-12**

1807.04724 | cs.CC

In this thesis, we survey techniques and results from the study of Complexity
Theory and Games. We t… show more

**2018-12-04**

1812.01160 | cs.CG

In this paper, we show that deciding rigid foldability of a given crease
pattern using all creases i… show more

**2018-11-07**

1811.02944 | cs.DB

The field of knowledge compilation establishes the tractability of many tasks
by studying how to com… show more

**2018-09-07**

1809.02421 | cs.ET

Adiabatic circuits are heavily investigated since they allow for computations
with an asymptotically… show more

**2018-10-11**

1810.05234 | quant-ph

In this paper, we construct a new scheme for delegating a large circuit
family, which we call "C+P c… show more

**2018-11-14**

1811.06011 | quant-ph

Large scale quantum computing is highly anticipated, and quantum circuit
design automation needs to … show more

**2017-09-10**

1709.03065 | cs.ET

Polymorphic circuits are a special kind of circuits which possess some
different build-in functions … show more

**2018-03-29**

1803.11017 | cs.ET

Power dissipation is the main limitation of all the nano electronics design
techniques including Qua… show more

**2015-05-10**

1505.02372 | cs.CC

The reversible logic can be used in various research areas, e.g. quantum
computation, cryptography a… show more

**2013-02-21**

1302.5382 | cs.ET

A rotation-based synthesis framework for reversible logic is proposed. We
develop a canonical repres… show more