The Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) has issued a challenge to find the difficulty of solving certain problems. One of the problems they suggested is Keller's Conjecture. This paper explores the Keller Conjecture for a non-expert reader. We will explain what Keller's Conjecture is and what is already known about the problem. We show how a computer could search for a solution. Then discuss an algorithms that will do the search. The performance of the algorithm could show important information about the difficulty of the Keller Conjecture.