Donald Knuth conjectured that every positive integer could be created with a single 4 and some combination of the square root, floor, and factorial operations. This interactive implementation uses a Breadth First Search to find and display solutions to this problem. Future versions will incude various other search algorithms to demonstrate the important differences between them. The smallest positive integer that eludes this current implementation is 9.