数独的规则是:

1. 直行, 横行只能有1~9且不能重复

2. 9个小正方形里也只能有1~9且不能重复.



当使用者输入的资料量过小时, 代表你的程式必须处理大量的运算, 如果不用点聪明的方法(e.g. 只用一个一个试的排列法的话), 程式可能会要执行好几个小时.



数独盘是9x9=81, 要是使用者一开始只给10个数字, 那程式就要解出71格. 如果程式的起始格不好, 那worst case将会是近似(9!*9)= 3265920可能性要试.



-independence in the few rules : 1. Straight, only a rampage ~ 9 but should not repeat the two. nine small square Lane only have one to nine and can not be repeated. When users lose the amount of data into the off hours, on behalf of your programs must handle a large number of computing, if we do not point smarter ways (eg only one with a try by law), programs may be to perform a couple of hours. several independent disk is 9x9 = 81, If users have only to a 10 figures, it should come up with programs 71 grid. If the starting grid formula well, That worst case will be similar to (9! * 9) = 3265920 possibility to trial.