P versus NP Problem Solution and the practical solution to the

Minesweeper game
Seun Adedokun
Abstract This electronic document is a live template. The
various components of your paper [title, text, heads, etc.] are
already defined on the style sheet, as illustrated by the portions
given in this document.

I. INTRODUCTION
This is manuscript 7 of my solution to the P versus NP
Problem where i explain the Seun Adedokun Polynomial
Algorithm that i formulate and the fact that it runs as a
polynomial time algorithm where i formulate the solution
to the minesweeper game
II. S EUN A DEDOKUN P OLYNOMIAL A LGORITHM
A. Minesweeper computational complexity analysis
I have formulated the Seun Adedokun Polynomial Algorithm as a solution to the minesweeper game which is
a method to quickly convert any boolean circuit into a
minseweeper grid that is possible since i prove that the
boolean circuit is satisfiable
B. Boolean Circuit
I explain the Seun Adedokun Polynomial Algorithm that
i formulate and i explain teh fact that based on the Seun
Adedokun Polynomial Algorithm the Boolean circuit is
satisfiable for the minesweeper grid analysis
I show that with the Seun Adedokun Polynomial Algorithm
that i formulate i am able to solve teh problem of computing
the output of a given boolean circuit on a given input string
The basis for the Boolean circuit is the AND OR NOT from
which i can compute other boolean functions

I engender a new formulation on logic gates and

programmable logic circuits in terms of capacity where i
should have 4 logical output for an OR and AND operation
on the logical boolean values 0 or 1 i can get 8 possible
output values
III. MATH
A. Logic gates
I explain the Seun Adedokun Polynomial Algorithm that
i formulate and the formulation that i engender in logic gates

C. Circuit Satisfiability problem solution

the circuit satisfiability problem is the decision problem
of determining whether a given boolean circuit has an
assignment of its input that makes the output true therefore
with the Seun Adedokun Polynomial algorithm i can show
that the boolean circuit which is a circuit representation of
the minesweeper grid is satisfiable
For a conjunctive normal form of circuit variables
(v1 ORV3 )AN D(v2 ORV3 )AN D(v2 OR v2 OR V3 )
I have shown that for any logic value of v1 v2 V3 the logical
clause (v1 ORV3 )AN D(v2 ORV3 )AN D(v2 OR v2 OR
V3 ) will always evaluate to true
I therefore engender a new formulation on logic gates and
programmable logic circuits where in terms of capacity
where i should have 4 logical output for an OR and AND
operation on the logical true and false values i can get 8
possible output values

B. AND Symbol
for the AND symbol
the logical expression for the logical AND is
INPUT OUTPUT
A B A AND B
000
010
100
111
The logical expression for the output are values 0 0 0 1
based on my formulation when A has a value true symbolic
of 1 NOT True can also have a value of 1 based on the
concept of second intension and the two meaning linguistic
relativity therefore i can have 8 logical output which means

I explain the Seun Adedokun Polynomial Algorithm and i

formulate the solution to the circuit satisfiability problem and
i explain practical application to Boolean circuit i explain the
practical application to logic gate
APPENDIX
Appendixes should appear before the acknowledgment.
ACKNOWLEDGMENT

an increase in the capacity of the logic circuit

The preferred spelling of the word acknowledgment in

America is without an e after the g. Avoid the stilted
expression, One of us (R. B. G.) thanks . . . Instead, try R. B.
G. thanks. Put sponsor acknowledgments in the unnumbered
footnote on the first page.
References are important to the reader; therefore, each
citation must be complete and correct. If at all possible,
references should be commonly available publications.
R EFERENCES

C. OR Symbol
for the OR symbol
the logical expression for the logical OR is
INPUT OUTPUT
A B A OR B
000
011
101
111
The logical expression for the output are values 0 1 1 1
based on my formulation when A has a value true symbolic
of 1 NOT True can also have a value of 1 based on the
concept of second intension and the two meaning linguistic
relativity therefore i can have 8 logical output which means
an increase in the capacity of tHE logic circuit
D. NOT Symbol
for the NOT symbol
the logical expression for the logical OR is
INPUT OUTPUT
A NOT A
01
10
The logical expression for the output are values 0 1 based
on my formulation when A has a value true symbolic
of 1 NOT True can also have a value of 1 based on the
concept of second intension and the two meaning linguistic
relativity therefore i can have 8 logical output which means
an increase in the capacity of the logic circuit
IV. CONCLUSIONS
This is manuscript 7 of my solution to the P versus NP
Problem where i explain the Seun Adedokun Polynomial
Algorithm that i formulate and the fact that it runs as a
polynomial time algorithm where i formulate the solution
to the minesweeper game

[1] question on boolean satisfiability criterion