W h e r e there is a I, those combinations of guilty and not guilty are still possible solutions. Fact 2 states that only one and only one of the three is guilty. This statement can be expresse d as: = 0 (fig I 0 + I4G + D G ) 0 0 Possible solutions to the crime are limited to combinations of guilty (1) and not guilty (0) making the above statement true (yield a 1). Since w e k n o w Fact i and Fact 2 are both true, then anding them together must yield a I. This statement can be expressed as: 1 = ( 0 = ( 0=MG)^(O=HG^MG) ) ^ ( I = H G + M G ÷ D G ) 0 0 1 0 0 0 Again, only combinations of guilty (I) and not guilty (0) that m a k e the above statement true (yield a I) are possible solutions to the crime. In this case only combination 5 makes this statement true. Therefore w e conclude that the M a r c h Hare is guilty. ¢ m e n t a l l y improved in multiple
/lp/association-for-computing-machinery/a-kaizen-strategy-for-apl-education-Cr1nQoIh0A