It seems that almost every Boolean expression I try and solve, I always find a Boolean Discrepancy . I could go back and use a different property, theorem, or law at different points of the process, and get a different solution every time. Obviously this means I am missing some information.
Depending on the decisions made in the moment, it will drastically change the equation, and will result in a different binary output from the answer. I am aware that sometimes with 'Karnaugh Maps' you can get rid of certain values in the Boolean logic. And you can get a further simplified expression.
What rules or information am I missing that determines what rules I should use at certain points of the simplification of an expression?
There are laws to follow, but what is illegal to do in Boolean Algebra?
Supply me with any additional information you have about this topic.