uFdooW的个人资料

Dynamic Nested Forcing 本帖内容复制自:SudokuSnake 网站. A Dynamic Nested Forcing Chain is a very advanced solving technique required only in the most difficult of Ludicrous-level Sudoku puzzles. It allows for one full Dynamic Forcing Chain to be nested within another. The potential eliminations caused by the original chain are allowed to change weak connections to strong connections in the nested chain. Then, if the nested chain weakly connects back on its original candidate, that candidate can be eliminated from the original chain. Then, if the elimination of that candidate allows the original chain to weakly connect back on its original candidate, then that candidate can be eliminated. Dynamic Nested Forcing Chains can be spotted by making a guess within a guess. If the guess within the guess is wrong, then that value can be removed, but only within the scope of the first guess. It doesn't mean that candidate is absolutely wrong, only that it must be wrong IF the first guess is right. Then, if because of that you show that the first guess is wrong, then you can eliminate ONLY the first guess. Sudoku Snake does not support hints or suggestions for Dynamic Nested Forcing Chains because of the processing time required to identify them. Sudoku Snake only utilitizes this advanced technique during the Analysis of puzzles. Sudoku Snake gives Dynamic Nested Forcing Chains a skill value of 65000.

试数与逻辑解法的比较刚好解完谢大师在"独数之道"出的 "阳光三叠NO 011",拿来比较一下.如题:

吧里有对MS C++熟悉的请相告前些日子 @roccloud 要了一份我的数独软件,经试用,感觉没有字串的输入和编辑功能,很不方便.所以想把该功能加上去,但有些问题解决不了,想要请教.望行家相助.

数独的专家解法--穷举之所以起这个名字,是因为年轻时玩桥牌,有一本书叫 "桥牌的专家打法", 书名这么叫是为了销路,而我只是为了吸引大家的眼球,请不要对号入座. 解这道题时,虽然也会用链,现在看来,应该是Forcing Chain 和 Forcing Net,对AIC 略有所闻,常用的简单的一些技术都会用.本题用到的Nakked Double Loop 不会. 我对本题印象深刻,原因有二:其一,这是我玩数碰到的第一道难题, 当时,9981数独论坛上,有人发帖说,他的朋友只用半小时就解开,我是羡慕得不得了把题目抄下来,过些日子就拿出来看看,到后来隐隐感觉某些候选数之间有一定的联系, 可就是说不出来.直到有一天。。。。。。其二,大家知道我喜欢把题解过程帖出来, 9981论坛上也有一位喜欢把解题过程帖在论坛上,我俩平时也就是各玩各的, 没有半点联系,突然有一天,他给了一道题让我解,不知他的意图,解完后, 放在论坛上.这下闯下麻烦了,一下子给了我5道这个类型的题,其中的第一题就是这题, 我知道很难(难度系数是多少昨天才知道),解不了,就没有理会,过几天, 又给了一道叫 "蜗牛“的难题，还是没理会他,结果,没几天他就开始发帖, 说我欺软怕硬,只会解简单的题.迫于无奈,只好硬着头皮继续探索,直到有一天, 突然想到一条链假设一个数不行,干嘛不试试两个数呢,这就有了本题的下面解法.

只区块和数组可用 004506070800004003070000500001040087760003000450000006000007002000890600000350010

只区块和数组可用 000000120000009006000080407936000050040000900281000000400107000100835000593206000

只区块和数组可用. 140030056509000103060000080000152000600708002000463000010000040903000201420070038

只区块和数组可用. 506010000082900000900708000004000900760000004090000650100007046000420010009050302

只区块和数组可用. 000000000002301800090546020987000546540000083326000719070618030003207100000000000

只区块和数组可用. 000905000010080070004000100060000010003000700071040390006000200000603000130708054

只区块和数组可用. 000000000000609000630000057000903000009504200400201006060000040080000010901406803

只区块和数组可用. 005000700000506000200719005083401590002000300061803270100274003000905000006000400

只区块和数组可用. 000000000000102000040809020000090000905401302008705600091000730052060840700000009

只区块和数组可用 800900015009700600000010000503020001702084000906070008000060000004100500600400037

一道ALS练习题前几天整理资料,看到这道题,标题是ALS练习题. 所以,务必请各位尽可能地用ALS来解. 008007905000300800000980042030000704200000006107000080580061000006002000702500600

只有区块和数组可用 005000480000500093900084005020050700006802500001070020400620001130008000067000900

一道直观题4 规矩不变: 只区块和数组可用 000600000000013900000895040502004190097000450014900703050138000001520000000006000

一道直观题3 外甥打灯笼规矩照旧只用区块和数组 010000800900000004000870200005030020007106300000080005409060000000400073060005080

一道直观题2 只区块和数组技法可用. 600907003007402600030060040380000074001000300470000056090020060004605800500103007

一道简单的旧题 000000008900600000005000200000007060008000000004300010700005000600000090000028000 可用任何技法

一道直观题

这是谢大师昨天的高级题#3234,兰色字是我填的. 00305000460000020000090103200010060000697000030040009020708000009000007100060300

谢大师今天的高级题: #3239 006010000740003010000700580000900000029050730000006000031007000070400051000080200