Another problem of minimality also remains unsolved—to wit, what is the smallest number of digits a puzzle maker can place in a starting grid and still guarantee a unique solution?

另有一类「极小」的问题也没有解：在保证有唯一解的条件下，一个少需要几个数字？