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?

另外有类「极小」的问没有解：在保证有解的条件下，个初盘至少需要几个数字？