705 research outputs found
Mastermind is NP-Complete
In this paper we show that the Mastermind Satisfiability Problem (MSP) is
NP-complete. The Mastermind is a popular game which can be turned into a
logical puzzle called Mastermind Satisfiability Problem in a similar spirit to
the Minesweeper puzzle. By proving that MSP is NP-complete, we reveal its
intrinsic computational property that makes it challenging and interesting.
This serves as an addition to our knowledge about a host of other puzzles, such
as Minesweeper, Mah-Jongg, and the 15-puzzle
FIFO anomaly is unbounded
Virtual memory of computers is usually implemented by demand paging. For some
page replacement algorithms the number of page faults may increase as the
number of page frames increases. Belady, Nelson and Shedler constructed
reference strings for which page replacement algorithm FIFO produces near twice
more page faults in a larger memory than in a smaller one. They formulated the
conjecture that 2 is a general bound. We prove that this ratio can be
arbitrarily large
Irrespective Priority-Based Regular Properties of High-Intensity Virtual Environments
We have a lot of relation to the encoding and the Theory of Information, when
considering thinking. This is a natural process and, at once, the complex thing
we investigate. This always was a challenge - to understand how our mind works,
and we are trying to find some universal models for this. A lot of ways have
been considered so far, but we are looking for Something, we seek for
approaches. And the goal is to find a consistent, noncontradictory view, which
should at once be enough flexible in any dimensions to allow to represent
various kinds of processes and environments, matters of different nature and
diverse objects. Developing of such a model is the destination of this article.Comment: 4 pages, 2 figures; ISBN: 978-1-4673-2984-
- …