NAND/XOR Challenge Solved!

Congratulations to Jake Smith for solving the NAND/XOR challenge from Class 5!

The minimum number of NAND gates needed to implement XOR is 5.

His solution used a brute force search through all possible formulas using NANDs to test them for logical equivalence to XOR.

You can find the Python code he used to do the search here: https://github.com/ION28/CS2102_ChallengeProblemSolutions/blob/master/CP1_NAND_Brute_Force.py.

His write-up of the solution, including a list of all 200 ways to define XOR using 5 NAND operations is here: Solution (PDF)