What is the least amount of hints a sudoku puzzle needs to be solved related to size $n*n$.
The classic sudoku puzzle is a $9*9$ grid that is divided into rows, columns and $9$ $3*3$ squares called a nonet, where:\
- Each column must contain the numbers $1-9$ without repetitions
- Each row must contain the numbers $1-9$ without repetitions
- Each nonet must contain the numbers $1-9$ without repetitions
Each puzzle is unique and has clues to solve the puzzle. Which are numbers. According to Cornell University there is no way to solve a sudoku with only 16 clues.
So, if there is $x>16$ clues needed for a $9*9$ sudoku, what is the formula for how many are needed for a $n*n$ grid?