• 公告

    • 叶卡林娜

      捐赠本站 (2022.06.20更新)   2017年04月13日

      独·数之道网站创建于2008年5月底,目前主要由休息负责网站程序、叶卡林娜负责日常管理。我们一直秉承着无广告、无弹窗、免费的公益原则,为大家提供数独游戏、教学、对战等服务。我们没有考虑过利用本网站盈利,今后也不会放置任何广告,所有能开发出的新功能、能获取的资料也会一如既往免费提供给玩家。但兴趣不代表一切,网站维持也需要费用,时常关注我们网站的朋友也会发现在2012年2月3号时网站无法访问,因为空间商认为本站的CPU资源占用大,而要求我们修改程序,在交涉后过了一天才同意重新开通帐号48小时后再次检测,但在2月6日下午再次被封。不过自此公告发出后收到了网友的捐赠,在2012年2月6日讨论后决定购买国内的VPS主机。希望有经济能力的朋友可以继续协助我们运营网站。

      目前网站运行费用:
      cn域名:99.00元/年,已续费2年(168.00元,有效期至2014年7月8日)
      已续费5年,55元/年,共计275元,有效期至2019年7月8日。
      2021.11.1已续费两年,35元/年,共计70元,有效期至2024年7月8日。

      西部数码国内VPS主机商务3型:2599.00元/年+补差价424.00元(2012.3.20支出)+补差价381.00元(2012.5.25支出).
      2013.3.31更换机房,补差价469.00元,续费一年3980.00元。(有效期至2014年4月17日)
      2014.4.2购入西部数码云主机,花费7900.00元,有效期至2018年4月2日。
      2017.05.28主机续费,花费7650.00元,有效期至2023年4月9日。
      2021.11.1主机续费,花费5496.00元,有效期至2028年4月8日。

      截至2012.05.25数独百科总收入3335.00元(现在已经取消现金奖励了)。
      2012.6出题费收入1000.00元。
      2012.11-2019.03.20江南晚报出题稿费收入8650.00元。 2021.2.4出题费收入1000.00元。

      网站七周年活动赠品总支出:1291.00元

      总余额:2086.00元

      如果你想捐助本站可以通过以下方式:
      支付宝捐助:转账至支付宝账号leafcard@gmail.com(如需赠品请留下地址、姓名、电话)
      请在付款时留下姓名以便我们统计,有问题可以发送站内信或邮件(leafcard@gmail.com)

      另外如果你希望帮助我们网站设计其他题型题库、美化首页、管理论坛欢迎跟我们联系,加入本站管理QQ群6750923,加入时请说明加入理由。

      目前收到捐赠列表(按捐赠时间倒序排列): 木心 200.00元(2022年6月17日)
      beibeiball 100.00元(2022年5月11日)
      行宇 100.00元(2021年11月19日)
      朱宝康 100.00元(2021年4月14日)
      零醇丘卡 200.00元(2020年4月12日)
      冯梓潇 300.00元(2020年3月31日)
      马鸿煜小朋友 110.00元(2020年3月28日)
      卢琨 68.00元(2019年10月2日)
      TheOne 188.00元(2019年8月11日)
      王思思 100.00元(2019年7月15日)
      辉 10.00元(2019年6月27日)
      蔚 200.00元(2019年3月15日)
      张老头(hsinli) 100.00元(2019年1月29日)
      周健懿 200.00元(2018年11月4日)
      胡巍(榕初) 500.00元(2018年8月28日)
      岳湘 50.00元(2018年7月25日)
      汤糖 100.00元(2018年7月2日)
      高魁 81.00元(2018年5月15日)
      温红毅 200.00元(2018年5月13日)
      刘启芳 50.00元(2018年4月10日)
      夏有章 100.00元(2018年3月26日)
      毛燕华 100.00元(2018年3月6日)
      迷 50.00元(2018年3月4日)
      邹剑洪 100.00(2018年1月4日)
      邓艳(指间沙) 100.00元(2017年9月28日)
      gzgyfwj 50.00元(2017年9月17日)
      谢道台(@TTHsieh) 600.00元(2017年6月4日)
      姚秀云 500.00元(2017年5月20日)
      文忠 100.00元(2017年5月19日)
      叶志鸿 55.00元(2017年5月16日)
      倚心 200.00元(2017年5月3日)
      李宏波(li2008di) 100.00元(2017年4月6日)
      黄中华 200.00元(2016年10月6日)
      Unyielding head 10.00元(2016年9月25日)
      川云 100.00元(2016年9月18日)
      章文嵩 688.00元(2016年4月16日)
      窗外的远景 100.00元(2016年3月23日)
      檀银兵(老猫) 388.00元(2016年3月15日)
      彤洋 100.00元(2015年10月7日)
      连伟杰 500.00元(2015年6月16日) - 未提供地址
      李芊子 100.00元(2015年5月25日)
      韩春英(群ID:冬天老顽童) 100.00元(2015年5月25日)
      王鹏威(群ID:datou) 100.00元(2015年5月20日)
      zrlyg(@自然) 333.00元(2015年5月14日)
      徐燕 200.00元(2015年5月14日)
      小星 40.00元(2015年5月13日)
      黄振谱(群ID:甫问)500.00元(2015年5月13日)
      石鹏(群ID:锦云) 100.00元(2015年5月13日)
      钱坤(群ID:下沉的浮力) 500.00元(2015年5月13日) - 未提供地址
      杨超(群ID:sokoban) 121.00元(2015年5月13日)
      卓诗维(群ID:Estela) 80.00元(2015年5月12日)
      邓艳(群ID:指间沙) 100.00元(2015年5月12日)
      王嘉豪(群ID:超级剑客davis) 500.00元(2015年5月12日)
      谭建红 100.00元(2015年5月12日)
      孙军 100.00元(2015年5月12日)
      王思思(@penny)100.00元(2015年5月12日)
      黄中华(群ID:yangzhou) 200.00元(2015年5月12日)
      庞东(群ID:简简单单) 100.00元(2015年5月12日)
      陈世鸿 100.00元 (2015年5月12日)
      黄晓伟(群ID:xiao01wei) 100.00元(2015年5月12日)
      高东友(群ID:羽翼) 200.00元 (2015年5月11日)
      甄敏鸿 200.00元(2015年5月11日)
      朱兵(群ID:酱牛) 100.00元(2015年5月11日)
      王明意(慕容) 100.00元(2015年5月11日)
      朱玉慧 80.00元(2015年5月11日)
      施政 100.00元(2015年5月10日)
      甘露 100.00元(2015年5月10日)
      瓜子拌饭 200.00元(2015年3月25日)
      jingle 200.00元(2015年1月20日)
      deliayk 200.00元(2014年10月28日)
      R9 100.00元(2014年1月14日)
      王思思(@penny) 100.00元(2013年1月29日)
      芦向明(谜者老芦) 300.00元(2012年12月26日)
      谢道台(@TTHsieh)372.00元(2012年8月21日)
      黄宗杰 100.00元(2012年2月20日)
      贾思帆(群ID:justfun) 500.00元(2012年2月13日)
      朱兵(群ID:酱牛) 100.00元(2012年2月11日)
      应长丰(@乐逍遥) 200.00元(2012年2月11日)
      伊莎贝拉 200.00元(2012年2月10日)
      王嘉豪(群ID:终极剑客) 200.00元(2012年2月10日)
      刘旭辉(群ID:巧妮儿) 100.00元(2012年2月9日)
      席瑞娇 100.00元(2012年2月9日)
      盛平(群ID:歪歪) 500.00元(2012年2月9日)
      @迷糊笨笨 500.00元(2012年2月9日)
      黄中华(@yangzhou) 200.00元(2012年2月9日)
      史春燕(群ID:春燕) 100.00元(2012年2月8日)
      杨嘉 100.00元(2012年2月8日)
      赵晓红(群ID:small red) 200.00元(2012年2月8日)
      fpro32(程序交易通)50.00元(2012年2月7日)
      创造春天 50.00元(2012年2月7日)
      林贵新(@verydao) 500.00元(2012年2月6日)
      卢晓萍(群ID:夏天玩童) 600.00元(2012年2月5日)
      zrlyg(@自然) 800.00元(2012年2月5日)
      梁跃(@月亮大哥) 500.00元(2011年3月)
      廖然(@captain)600.00元(2010年11月)
      谢道台(@TTHsieh)500.00元(2009年3月)
    • 叶卡林娜

      数独谜题类站点博客列表   2017年04月13日

      网站类 Fed Sudoku - 每日数独,每周10题 Croco Puzzle - 每日两道谜题 Janko - 有很多谜题 Puzzle Picnic - 网友出的数独、谜题,每日更新一题 LogicMastersIndia - 每月数独谜题月赛 Killer Sudoku Online - 每日每周杀手数独、数比杀手数独 Sudoku Cup - 每年2次数独线上赛 Sudoku Variants - Uwe Wiedemann的数独谜题站点 The Griddle - David Millar的数独谜题站 Oubk欧泊颗 - 中文数独网站,可以在线PK 数独玩家论坛 数独解题技巧汇编 - 教你数独怎么玩 英国数独官网 澳洲数独官网 在线标准数独解析 - 教你数独技巧 Sudocue - 免费的数独软件sudocue,可解标准数独、锯齿数独、杀手数独 Djape - 他们有出版很多数独、谜题书籍 Griddlers - 数图专题网站 Nikoli - 日本谜题公司 17提示数标准数独搜集验证 Logic-Pixels
       
      博客类 The Art of Puzzles - Thomas Snyder(周五更新) Detuned Radio - Tom Collyer(周五更新) Melon's Puzzles - Palmer Mebane(周三更新) PS's puzzles + - Prasanna Seshadri(每日更新) (主に)へやわけ保管庫 - 木兄(每周2、3、5、6更新) Para's Puzzle Site - Bram de Laat A Cleverly Titled Logical Puzzle Blog - Grant Fikes 石氏是时试 - 本站站长休息 陈岑的数独博客 - 陈岑 创意数独 快乐生活 - 乐逍遥(应长丰) 金策空间 - jcvb(金策) 谜者老芦 - 芦向明
登录来追随这个  
追随者 0
righthand

转载:Solving without pencilmarks(不标候选解数独)

1 篇文章在这个主题里

在数独玩家论坛看到一篇不错的文章,转过来大家共享一下,原文地址为:

http://forum.enjoysu...arks-t3640.html

 

Solving without pencilmarks

 

by RW » Sat Mar 25, 2006 7:40 am

The more I read posts on this forum, the more I get the feeling that I'm the only person in the world who solve exclusively without pencilmarks, regardless off difficulty. I often read comments like "no other than the easiest puzzles can be solved without pencilmarks" or "techniques that are impossible for human solvers.". Now I wish to show you that none of those are true. First I'll give you some tips that I've found usefull, then I'll take you through a step by step solution of a couple of extreme puzzles, the way I solve them, and hope that you can follow without making any own pencilmarks.

 

If anybody else has got any good tips on solving without pencilmarks, please post them here and we can try to make a little collection of these techniques.

 

First of all, whenever I say that I solve without pencilmarks, peoples first reaction is: "then you must have a really good memory". My answer is yes, but I hardly ever use it. The most important thing I've learned so far is to choose what information to memorize. There is simply so much information to be found in any grid, that one can't remember it all. Most of this information is useless. When I started doing Sudoku I often found myself trying to memorize possible values for cells, drawing a mental pencilmarkgrid. When I finally realised that this is pointless, my solving improved significantly. Most puzzles can be solved exclusively with naked or hidden singles, then what's the point in knowing that a cell can hold numbers 1,2,6 and 7? In fact, all numbers are solved by naked or hidden singles, all other techniques only reduce possibilities. So what I’m interrested in is these reduced possibilities. Instead of memorizing possible candidates, I memorize impossible candidates. As most of the impossibles can be read from the column, row and box of each cell, there isn’t really that much to remember. Only when I make a reduction through some other technique, like x-wing, uniqueness etc., I memorize the reduced candidates. Apart from this I memorize locations of pairs and triplets, but the rest of the information about each cell I put aside as soon that I can see that it doesn’t help me at the moment.

 

I guess most of you use pencilmarks to spot singles, so the most important thing to improve if you want to solve without pencilmarks is not your memory, but your ability to spot singles. The hidden singles are usually easy to spot, just picture horisontal and vertical lines going through all instances of a particular number and find the only empty square. Naked are harder to find. Going through the whole puzzle cell by cell is very timeconsuming. I rather look for them one row or column at a time. I start with the rows/columns that have most numbers already, then I count from 1 to 9, leaving out all the numbers already in the row. Example:

 

*-----------*|..1|..2|35.||...|...|2..||.8.|4..|.91||---+---+---||5.9|31.|4..||...|7.4|...||..7|.25|8.3||---+---+---||86.|..9|.3.||..3|...|...||.74|1..|5..|*-----------*
If I wanted to find naked singles in this puzzle, I would start with row 4 that already has 5 numbers, then count: “. 2 . . . 6 7 8 .” These are the 4 numbers that go in the four empty cells, so now I compare each cell against these numbers. R4c2 has 6, 7 and 8 in the same column, so there’s a naked single (2). This trick is also efficient when looking for hidden singles in rows or columns (try it on row 6). If you systematically go through all rows like this you will find all naked singles in no time.

 

So when do I need the good memory? That’s only when I can’t find anything else and start “trailing”. Trailing is a common term I like to use for any technique that involves reading many steps ahead. The different trails I’m looking for are trails that lead to contradictions, double solutions or forcing chains (which obviously involves at least two trails). Almost any puzzle can be solved with relatively short (<5 steps) trails, only the most evil puzzles require longer. Reading many steps ahead requires a lot of practise, but it’s not in any way impossible to learn. You may start your practise on easy puzzles that you can effectively solve without marks already. Instead of writing in an obvious number, try to find one or two other numbers solved by your original number and then write them in all at a time. Then you can gradually extend the trail. I used to have problems reading more than 3 steps ahead, now I usually solve all puzzles up to moderate level in my local newspaper one number at a time - don’t write down anything until I solved all instances of the number. This might seem hard at first, but with proper training anybody can run a marathon.

 

Another question I often get is ”how can you use advanced techniques like coloring or XYWhatever-wing without pencilmarks?” The answer is very simple, I don’t use them. Techniques like these are in my opinion not at all advanced, but limitations of the real techniques behind them. They are limitations in the sence that they actually apply different trailing techniques, but only on very special patterns that somebody has predefined for you as they can be seen in a pencilmarkgrid. When programming your solver software this might be neccessary, but as a human solver you should be able to see the logic in any situation.

 

Take for example “multiple colors”. When I first got Simple Sudoku I opened a “multiple colors”-example to see what it was about. First I solved it in my way, then I checked how SS would have done it. I found that it colored all cells with candidate 2 in five different colors, then removed some candidates of number 2. I could see that all these candidates shared an unit with a 2 that I had solved with a short forcing chain. I then checked all the other examples of multiple colors and found that in every case a cell connecting all removed candidates could be solved with a simple forcing chain. So apparently this is a technique that you can use instead of a forcing chain if it considers only one candidate number, if all instances form a specific pattern and if you have a good set of crayons. Well, then I prefer the forcing chain as it applies to endless situations where the crayons won’t help you. Guess you want to see the example:

 

 

*-----------*|78.|3..|.1.||615|.8.|.32||3.9|.1.|8..||---+---+---||1.8|..3|.6.||.73|462|1..||.6.|1.8|7.3||---+---+---||..1|.3.|6..||85.|.4.|3.1||.3.|..1|..5|*-----------*
I used this forcing chain:

if r1c3=2 => r9c5=2 => r4c7=2

if r3c2=2 => r6c1 or r6c3=2 =>r4c7=2

 

Simple sudokus advanced spread of colors across the grid ended up in removing candidate 2 from r4c2, r6c8 and r9c7, which I obviously also could do after solving r4c7 with the forcing chain.

 

My last tip before getting on with the actual puzzles is this: UNIQUENESS!! Uniqueness patterns are everywhere and they often provide a very easy solution to extreme puzzles. The best thing with them is that they are very easy to spot. Again, don’t limit yourself to the reductions explained in different forums, be creative. My approach is that whenever I see two corners of a uniqueness square in place, I put in a third corner and read ahead to see if it gives me the forth. Actually, whenever I could make any move that results in three corners of the square in place I read ahead to see if the forth falls in place. It often does, so these are very good spots to start your trails from if you're stuck.

 

Now let’s have a look at some extreme puzzles. I recommend that you copy them into some sudoku program (without pencilmarks) and follow as we go along. To help you follow without pencilmarks I’ll use these abbreviations on how I solve each number:

 

Ce = only possible number that can go in the cell

Co = only possible cell for number in column

R = only possible cell for number in row

B = only possible cell for number in box

 

First an extreme from Simple Sudoku:

 

Puzzle 1

 

 

*-----------*|.2.|1.8|..5||1..|.76|.3.||7..|4..|...||---+---+---||..7|...|2..||48.|...|.59||..2|...|6..||---+---+---||...|..9|..1||.5.|74.|..6||6..|8.1|.7.|*-----------*
First the obvious ones:

r7c2=7 ( B)

r1c7=7 ( B)

r6c9=7 ( B)

r5c6=7 ( B)

r8c3=1 ( B)

 

I can’t see anymore obvious cells by drawing lines, but I can see two pairs: r78c1={2,8} ® and r23c3={5,8} ( B). Next I start checking rows, starting with row 1. Two pairs there also: c1&5={3,9} and c3&8={4,6}. This is enough to solve the next number:

 

[edit: typo there, the first pair should read r78c1={2,8} (Co) = the two numbers cannot go anywhere else in the column.]

 

r9c3=9 (Co)

 

This gives me another pair: r7c3 and r9c2={3,4} – so far 5 pairs to remember. Now I see a very obvious trail:

 

if r1c1=9 => r3c2=3 ( B) => r9c2=4 (Co) => r1c3=4 ( B) => nowhere to place 6 in box 1. This gives me:

 

r1c1=3 (Ce)

r1c5=9 (Ce)

 

At this point I can tell that 5 cannot go in r4c4 or r6c4 ({9,5} uniqueness square with c1), always worth to notice.

 

I decide to check the other pair of row 1 and find:

if r1c3=6 => r1c8=4 => r4c9=4 ( B) and

if r1c3=6 => r2c2=4 => r9c2=3 => nowhere to place 3 in column 9. This gives me:

 

r1c3=4 (Ce)

r1c8=6 (Ce)

r3c2=6 ( B)

r5c3=6 ( B)

r7c3=3 (Ce)

r9c2=4 ( B)

r2c2=9 ( B)

 

Now I have:

 

 

*-----------*|324|198|765||19.|.76|.3.||76.|4..|...||---+---+---||..7|...|2..||486|..7|.59||..2|...|6.7||---+---+---||.73|..9|..1||.51|74.|..6||649|8.1|.7.|*-----------*
Still can’t see any obvious so I have a look at column 9, missing numbers 2,3,4 and 8. This gives me an idea that I have to check out and this is what I see:

 

if r3c5 or r3c6=2 =>r2c9=2 ( B) and

if r2c4=2 => r2c3=5 ® => r3c3=8 => r3c9=2 (Ce)

 

Anyway, r9c9 cannot be 2. This gives me a 2 in either r7c8 or r8c8 that not only forms an x-wing with c1 but also lets me exclude 8 from both squares (uniqueness). Thanks to this I can go on:

 

r8c6=3 (Ce)

r9c5=2 ( B)

r5c4=2 ( B)

r3c6=2 ( B)

r2c9=2 ( B)

 

and so on... rest of the puzzle is only singles so I guess you can do it yourself. There the puzzle was solved with a few short trails, max 4 steps. Could you follow without pencilmarks? If you could, then you can also do this yourself. If you try enough short trails you will find lots of reductions like the ones I made here. As you could see the only neccessary memorizing I did was the 5 pairs, that soon could be forgotten as they were solved (or made obvious by filling in the rest of the boxes), and then i memorized max 4 numbers at a time while trailing.

 

Let’s have a look at one more puzzle, this is a Solo extreme, that Simple Sudoku cannot provide a logical solution for. Let’s find out how hard it really is:

 

Puzzle 2

 

 

*-----------*|1..|.32|5..||5..|...|.92||7..|5..|4..||---+---+---||...|.2.|71.||...|4.8|...||.21|.5.|...||---+---+---||..8|..5|..7||31.|...|..6||..7|84.|..9|*-----------*
First the singles:

r3c9=1 (Co)

r5c2=7 ( B)

r1c8=7 ( B)

r1c9=8 (Ce)

r2c6=4 ( B)

r4c1=8 ( B)

r3c3=2 ( B)

r5c5=1 ( B)

r2c4=1 ( B)

r2c5=7 ( B)

r2c2=8 ®

r3c5=8 ( B)

r9c6=1 ( B)

r7c7=1 ( B)

r7c5=6 ®

r8c5=9 (Ce)

r7c4=3 ( B)

r8c4=2( B)

r8c6=7 (Ce)

r6c4=7 ( B)

r8c7=8 (Ce)

r6c8=8 ( B)

 

This is the situation:

 

 

*-----------*|1..|.32|578||58.|174|.92||7.2|58.|4.1||---+---+---||8..|.2.|71.||.7.|418|...||.21|75.|.8.||---+---+---||..8|365|1.7||31.|297|8.6||..7|841|..9|*-----------*
At this point I can’t see any more obvious cells, so I start reading through rows and columns. In column 1 I react on r5c1 that has to hold 6 or 9. This tells me that if r5c7=9 => r5c1=6 (Ce) => r6c7=6 ( B). That’s three corners of the uniqueness square so I decide to follow the trail a bit further. And, not to my suprise, I find three steps ahead:

 

if r5c7=9 => r5c1=6 (Ce) => r6c7=6 ( B) => r3c8=6 ( B) => r3c6=9 (Ce) => r6c1=9 ® => Double solution. I can remove that option and go on:

 

r6c7=9 ( B)

r5c1=9 (Ce)

r7c2=9 ( B)

r1c3=9 ( B)

r3c6=9 ( B)

r4c4=9 ( B)

r1c4=6 (Ce)

r1c2=4 (Ce)

 

Current situation:

 

 

*-----------*|149|632|578||58.|174|.92||7.2|589|4.1||---+---+---||8..|92.|71.||97.|418|...||.21|75.|98.||---+---+---||.98|365|1.7||31.|297|8.6||..7|841|..9|*-----------*
Now this trail immediately jumps into my face:

 

if r4c2=3 => r6c6=3 ( B) => r6c1=6 ® => no way to fit numbers 3 and 6 into column 3. I can remove that option and continue:

 

r3c2=3 (Co)

r2c3=6 (Ce)

 

...you may fill in the remaining singles. That wasn’t so hard, was it? This time I didn’t actually memorize anything except the two short trails.

 

I hope I have showed by this that memory isn’t the biggest issue when solving harder puzzles without pencilmarks, but learning to see patterns and short trails. Don’t focus on trails you’ve read about in technique guides, because (a) you won’t see them (they are defined by possible candidates) and ( B) they are very limited. With pure logic and the ability to read 5 steps ahead you can solve almost any puzzle this way.

 

regards, RW

 

PS. Seems my trails have a lot in common with what you call nice loops. If so, feel free to translate them into the "correct" language that I don't really master yet.

分享这篇文章


链接文章
分享到其他网站

建立一个帐号或登录来留意见

您需要成为会员才能留意见

建立一个帐号

注册成为我们的会员。这只要几个简单步骤!


注册新帐号

登录

已经有帐号?请在这里登录。


立即登录
登录来追随这个  
追随者 0