title: Using a giant hashtable to solve a sudoku in polynomial time
body: <p>Say you were to create a hash table that maps every possible valid 9x9 sudoku (not yet filled in) to its solution. (as infeasible a task as this would be)</p>
  
  <p>Then you were to create a simple program that takes a valid 9x9 sudoku (again, not yet filled in) as input and returns the solution that is mapped to it in the hashtable described above.</p>
  
  <p>Would this not be considered a sudoku solver that works in polynomial time?</p>
  
  <p>Is there something about this theoretical solution that disqualifies it from being proof that sudoku is a P class problem?</p>