太傻超级论坛's Archiver

咕咕!!~~~ 发表于 2007-6-1 19:54

数独俱乐部

[align=center][color=blue][size=7][b]太傻数独俱乐部[/b][/size][/color][/align]jr)E0F1Y
0? J Tx0TJ%G?
[align=center][size=7][color=#0000ff][/color][/size][/align][align=left][color=blue][size=4][/size][/color][/align][align=left][color=blue][size=4]您好,欢迎光临本俱乐部,希望寻找到热爱数独的太傻人~[/size][/color][/align][align=left][size=4][color=blue]所有希望加入的太傻人只须在本楼内报道即可[/color][/size][/align][align=left]
OH Z&D+c [size=4][color=#4169e1][/color][/size][s^yA$d'g9U
[size=4][color=blue]楼内详情:X2r6y[pS
[/color][/size][size=3][color=royalblue][b]2楼:[/b]          数独历史[/color][/size][/align][align=left][size=3][color=#4169e1][/color][/size][/align][align=left][size=3][color=royalblue][b]3楼:       [/b]数独简介   [/color][/size][size=3][color=royalblue](英文版 含competition)[/color][/size][/align][align=left][size=3][color=royalblue][b]4楼:[/b]         俱乐部人员名单 [color=red][b]新的游戏软件下载[/b][/color][/color][/size][/align][align=left][size=3][color=royalblue][color=#ff0000]                 [/color](大家谁给弄个会员资料表格 不知道有必要不... 或者改天我来弄...)[/color][/size][/align][align=left][size=3][color=#4169e1][/color][/size][/align][align=left][size=2][color=royalblue][size=3][b]5楼:      [/b]4种[color=royalblue]难[/color][/size][/color][color=royalblue]度等级的样题[/color][/size][/align][align=left][size=2][color=#4169e1][/color][/size][/align][align=left][size=2][color=#4169e1][/color][/size][/align][align=left][size=3][color=#4169e1][color=royalblue][b]6楼:[/b]        关于原创数独[/color][/color][/size][/align][align=left][size=3][color=#4169e1][/color][/size][/align][align=left][size=3][color=red][/color][/size][/align][align=left][size=4][color=#4169e1][b]19楼:    [/b]4星题 [/color][/size][size=4][color=#4169e1](20楼附答案)(希望大家帖上各星级的题各一个 以便新手自我定位)[/color][/size][/align][align=left][size=4][color=#4169e1][/color][/size][/align][align=left][size=4][color=#4169e1][/color][/size][/align][b][size=3][color=red]72楼:      文件下载[/color][/size]
9j_0{/X_bY [size=3][color=red]                (关于数独的介绍,一个pdf文件和 一个数独的小软件)[/color][/size][/b]Le+e \D*Z
kHZ[YF$Y;m H

#|ff6ic;aD8e Qe [align=left][size=3][color=blue][/color][/size][/align][align=left][size=3][color=blue]最后再次欢迎大家加入本俱乐部,提出宝贵的意见 谢谢大家的光临和支持!!![/color][/size][/align][align=left][size=3][color=#0000ff]感谢在创建期间关心我帮助我的老板和ROBBECA TAO二位斑竹大人~[/color][/size][/align][align=left][size=3][color=#0000ff][/color][/size][/align]5A v(P`@k.T
+N)ys&v2Bg5c },^

U M7M'G*|!B_f(? [align=left][size=3][color=#0000ff][/color][/size][/align][align=left][size=3][color=#0000ff][/color][/size][/align][align=left][size=3][color=#0000ff][/color][/size][/align][align=left][size=3][color=#0000ff][/color][/size][/align][align=left][size=3][color=#0000ff][/color][/size][/align][align=left][size=3][color=#0000ff]注:[/color][/size][/align][align=left][size=3][color=#0000ff]由于是后期整理 所以有些乱.... SORRY了各位...[/color][/size][/align]
f gF1u;eSy
`{ v gK$|zv [[i] 本帖最后由 yzxjy 于 2008-1-8 14:07 编辑 [/i]]

咕咕!!~~~ 发表于 2007-6-1 20:05

http://sudoku.oubk.com/Technique/About_Sudoku_CN.html

[size=7][color=blue]数独的历史:[/color][/size](B-M)yt[:YXpjZ/|
[color=blue][/color] 4y+J6VMl*A
[color=blue][/color]
8hE5qdS [color=blue][/color]
Q/F(Vt F*O [color=blue]数独(日语:数独 すうどく)是一种源自18世纪末的瑞士,后在美国发展、并在日本得以发扬光大的数学智力拼图游戏。拼图是九宫格(即3格宽×3格高)的正方形状,每一格又细分为一个九宫格。在每一个小九宫格中,分别填上1至9的数字,让整个大九宫格每一列、每一行的数字都不重复。 )^3Yp a1hlnZ
N7ZX8lh
数独的玩法逻辑简单,数字排列方式千变万化。不少教育者认为数独是锻炼脑筋的好方法。
"d ])P!Ys&i"r"d $~2{J9|/P+T9U.f~
M.DBq*A3|
历史
!FPy%[;g] 如今数独的雏型首先于1970年代由美国的一家数学逻辑游戏杂志发表,当时名为Number Place。现今流行的数独于1984年由日本游戏杂志《パズル通信ニコリ》发表并得了现时的名称。数独本是“独立的数字”的省略,因为每一个方格都填上一个个位数。
u3Oa]9x?e
&JVVD'a5\ 数独冲出日本成为英国当下的流行游戏,多得曾任香港高等法院法官的高乐德(Wayne Gould)。2004年,他在日本旅行的时候,发现杂志的这款游戏,便带回伦敦向《泰晤士报》推介并获得接纳。英国《每日邮报》也于三日后开始连载,使数独在英国正式掀起热潮。其他国家和地区受其影响也开始连载数独。
;?ZB4e!{*t.}^#B
/J-o%lt_\FHTd4G 解法举例 uLD3cl%e5e?%R5Y
先注意其中一个方格,限定该方格内可以填写的数字。
L&oxN@x v_ 注意其中一列(或者其中一个小九宫格),寻找填写某数字的方格。 eK(pO r&U
学过“资料结构”的人,可以尝试用Backtrack试试。 GA XXxx
数独的通解方法及步骤:
KK(~AV)T6?
\0D9R#Z4hsjD 根据以下方法可以确保最终得到数独的解,而且通过手工运算的时间基本可以控制在1.5个小时,不论难易程度,所以此方法可以作为取得数独答案的一般解法。 p R/n xS
1、根据横列、竖列和方格的限制条件排除各个点不可能的数字,并从1-9将各个可能的数字用小字体逐个写进每个空白的格子。(该步骤大约需要15-20分钟,这是求解的初始,务必确保没有遗漏)。
)~8A`jHo;v'q Sd,c.zh}IM._ |
2、审视第一步骤的结果,如果发现某个空格只有一个数字,即确定该空格为这个数字。并根据该数字审视其相关的横列、竖列和方格,并划除相同的数字。(该情况出现的可能往往不多,除了较简单的数独题,但这是一个必要的过程,而且在随后的过程中要反复使用此方法。) LwP6y-V/ZN
%d'i{IJj
3、审视各个横列、竖列和方格中罗列出的可能的数字结果,若发现某一个数字在各个横列、竖列或方格中出现的次数仅一次,则可以确定该空格的解为此数字。并根据第二条的方法排除与此空格相关列或方格中相同的数字。
w9q&v E X1E b
EB@+c KG2e:yE 4、审视各个横列、竖列和方格中罗列的各个可能的结果,找出相对称的两个数组合的空格(或3个、4个组合),并确定这两个空格(或3个、4个)的数字只可能为这两个数字,即两个数字在这两个空格的位置可以交换,但不可能到该行、该列或该方格的其他位置。根据此结果可以排除相关列或方格罗列出相关数字的可能,并缩小范围。(该步骤处理的难度相对复杂,需要在积累一定经验的基础上进行,也是最终求解的关键)
*l6JZgt0[l[ 4{%U%QM3h
5、反复使用2、3、4提到的步骤,逐步得到一个一个空格的解,并将先前罗列的各种可能的结果一个一个排除,使可能的范围越来越小,直至得到最后结果。[/color] X.D%j?(X$Kc/n ]
w+bXuG:X
[[i] 本帖最后由 3707 于 2007-7-5 14:57 编辑 [/i]]

yzxjy 发表于 2007-6-2 10:02

[align=center][size=7][color=purple][b]Sudoku[/b][/color][/size]H*U`pn:gu Zr5nF[
[color=dimgray]From Wikipedia, the free encyclopedia[/color]+g%p wE6W(R7K:a `
Jump to: [url=http://en.wikipedia.org/wiki/Sudoku#column-one][color=#800080]navigation[/color][/url], [url=http://en.wikipedia.org/wiki/Sudoku#searchInput][color=#800080]search[/color][/url]Xs)?qY
[i]This article is about the logic puzzle. For the disease, see [url=http://en.wikipedia.org/wiki/Sodoku][color=#0000ff]Sodoku[/color][/url].[/i]
F4iu2a,j,} [url=http://en.wikipedia.org/wiki/Image:Sudoku-by-L2G-20050714.svg][img=250,250]http://upload.wikimedia.org/wikipedia/en/thumb/f/ff/Sudoku-by-L2G-20050714.svg/250px-Sudoku-by-L2G-20050714.svg.png[/img][/url] [float=right][url=http://en.wikipedia.org/wiki/Image:Sudoku-by-L2G-20050714.svg][img=15,11]http://en.wikipedia.org/skins-1.5/common/images/magnify-clip.png[/img][/url][/float].I8_9b"v m
A sudoku puzzle...v s2L;}R
6UQ(Mg fR GZ
zU@k)|ok
[url=http://en.wikipedia.org/wiki/Image:Sudoku-by-L2G-20050714_solution.svg][img=250,250]http://upload.wikimedia.org/wikipedia/commons/thumb/3/31/Sudoku-by-L2G-20050714_solution.svg/250px-Sudoku-by-L2G-20050714_solution.svg.png[/img][/url] [float=right][url=http://en.wikipedia.org/wiki/Image:Sudoku-by-L2G-20050714_solution.svg][img=15,11]http://en.wikipedia.org/skins-1.5/common/images/magnify-clip.png[/img][/url][/float]
+`6~-F Ta7n1E,N fJ ...and its solution numbers marked in red
O|+oe EY .dqG1t,] H ]

7`gzD(X|\"Zx h [i][b]Sudoku[/b][/i] (数独, [i]sūdoku[/i][url=http://en.wikipedia.org/wiki/Help:Japanese][font=Tahoma][size=2]?[/size][/font][/url]) [i][url=http://upload.wikimedia.org/wikipedia/commons/5/58/Sudoku.ogg][color=#0000ff]listen[/color][/url] [size=2]([/size][url=http://en.wikipedia.org/wiki/Wikipedia:Media_help][size=2][color=#0000ff]help[/color][/size][/url][size=2]·[/size][url=http://en.wikipedia.org/wiki/Image:Sudoku.ogg][size=2][color=#0000ff]info[/color][/size][/url][size=2])[/size][/i] is a [url=http://en.wikipedia.org/wiki/Logic][color=#0000ff]logic[/color][/url]-based number placement [url=http://en.wikipedia.org/wiki/Puzzle][color=#0000ff]puzzle[/color][/url]. The objective is to fill a 9x9 grid so that each column, each row, and each of the nine 3x3 boxes contains the digits from 1 to 9. The puzzle setter provides a partially completed grid.
Ws;N_+W~3s!k;~ Completed [i]Sudoku[/i] puzzles are a type of [url=http://en.wikipedia.org/wiki/Latin_square][color=#0000ff]Latin square[/color][/url], with an additional constraint on the contents of individual regions. [url=http://en.wikipedia.org/wiki/Leonhard_Euler][color=#0000ff]Leonhard Euler[/color][/url] is sometimes incorrectly cited as the source of the puzzle, based on his work with Latin squares.[url=http://en.wikipedia.org/wiki/Sudoku#_note-0][color=#800080][1][/color][/url]R?2Mei svB
The modern puzzle was invented by an American, [url=http://en.wikipedia.org/wiki/Howard_Garns][color=#0000ff]Howard Garns[/color][/url], in [url=http://en.wikipedia.org/wiki/1979][color=#0000ff]1979[/color][/url] and published by [url=http://en.wikipedia.org/wiki/Dell_Magazines][color=#0000ff]Dell Magazines[/color][/url] under the name "[i][b]Number Place[/b][/i]".[url=http://en.wikipedia.org/wiki/Sudoku#_note-1][color=#800080][2][/color][/url] It became popular in [url=http://en.wikipedia.org/wiki/Japan][color=#0000ff]Japan[/color][/url] in [url=http://en.wikipedia.org/wiki/1986][color=#0000ff]1986[/color][/url], after it was published by [url=http://en.wikipedia.org/wiki/Nikoli][color=#0000ff]Nikoli[/color][/url] and given the name Sudoku, meaning [i]single number[/i]. It became an international hit in [url=http://en.wikipedia.org/wiki/2005][color=#0000ff]2005[/color][/url].[/align]Difficulty ratings~5e9U"{6zZ
The difficulty of a puzzle is based on the relevance and the positioning of the given numbers rather than their quantity. Surprisingly, the number of givens does not always reflect a puzzle's difficulty. Computer solvers can estimate the difficulty for a human to find the solution, based on the complexity of the solving techniques required. Some online versions offer several difficulty levels.6D"ctM!U
Most publications sort their [i]Sudoku[/i] puzzles into four or five rating levels, although the actual cut-off points and the names of the levels themselves can vary widely. Typically, however, the titles are synonyms of "easy", "intermediate", "hard", and "challenging" (also known as "diabolical" or "evil"). An easy puzzle can be solved using only scanning; an intermediate puzzle may take markup to solve; a hard or challenging puzzle will usually take analysis.(l:b P5}]]
Another approach is to rely on the experience of a group of human test solvers. Puzzles can be published with a median solving time rather than an algorithmically defined difficulty level.`4wOThr)i i
r \(@ O8lv|n2?,H
[size=6][color=purple][b]Difficulty ratings[/b][/color][/size]K:C ~*W&CH7P!i NGH
The difficulty of a puzzle is based on the relevance and the positioning of the given numbers rather than their quantity. Surprisingly, the number of givens does not always reflect a puzzle's difficulty. Computer solvers can estimate the difficulty for a human to find the solution, based on the complexity of the solving techniques required. Some online versions offer several difficulty levels.
K'd!|(d+DT Most publications sort their [i]Sudoku[/i] puzzles into four or five rating levels, although the actual cut-off points and the names of the levels themselves can vary widely. Typically, however, the titles are synonyms of "easy", "intermediate", "hard", and "challenging" (also known as "diabolical" or "evil"). An easy puzzle can be solved using only scanning; an intermediate puzzle may take markup to solve; a hard or challenging puzzle will usually take analysis.
5_'\&u)L o7~~.S Another approach is to rely on the experience of a group of human test solvers. Puzzles can be published with a median solving time rather than an algorithmically defined difficulty level. { Q^.ID3N

'a1SPz'{ndO [size=6][color=indigo]Construction[/color][/size]Ke*ot-H|
Building a [i]Sudoku[/i] puzzle can be performed by predetermining the locations of the givens and assigning them values only as needed to make deductive progress. This technique gives the constructor greater control over the flow of puzzle solving, leading the solver along the same path the compiler used in building the puzzle. Great caution is required, however, as failing to recognize where a number can be logically deduced at any point in construction—regardless of how tortuous that logic may be—can result in an unsolvable puzzle when defining a future given contradicts what has already been built. Building a [i]Sudoku[/i] with symmetrical givens is a simple matter of placing the undefined givens in a symmetrical pattern to begin with.
,C&p3dJ5\7PR%f^F [url=http://en.wikipedia.org/wiki/Nikoli][color=#0000ff]Nikoli[/color][/url] [i]Sudoku[/i] are hand-constructed, with the author being credited; the givens are always found in a symmetrical pattern.[url=http://en.wikipedia.org/wiki/Sudoku#_note-8][color=#800080][13][/color][/url] Dell [i]Number Place Challenger[/i] (see Variants below) puzzles also list authors. The [i]Sudoku[/i] puzzles printed in most UK newspapers are apparently computer-generated but employ symmetrical givens; [i]The Guardian[/i] famously claimed that because they were hand-constructed, their puzzles would contain "imperceptible [url=http://en.wikipedia.org/wiki/Witticism][color=#0000ff]witticisms[/color][/url]" that would be very unlikely in computer-generated [i]Sudok[/i]
}u+Ws/L4MO
/{T#xX2JQvt;_X }N ^/A0U[|
[size=6][color=purple][b]Competitions[/b][/color][/size]
9aVCsP!F [list][*]The first world championship was held in [url=http://en.wikipedia.org/wiki/Lucca][color=#0000ff]Lucca[/color][/url], [url=http://en.wikipedia.org/wiki/Italy][color=#0000ff]Italy[/color][/url] from 10 to 12 March 2006;[url=http://en.wikipedia.org/wiki/Sudoku#_note-first_world_championship][color=#800080][28][/color][/url] it was won by Jana Tylová, a 31-year-old accountant from the [url=http://en.wikipedia.org/wiki/Czech_Republic][color=#0000ff]Czech Republic[/color][/url]. The competition included numerous variants.[url=http://en.wikipedia.org/wiki/Sudoku#_note-13][color=#800080][29][/color][/url][*]The second world championship was held in [url=http://en.wikipedia.org/wiki/Prague][color=#0000ff]Prague[/color][/url] from March 28 to April 1, 2007. The individual competition was won by Thomas Snyder of the [url=http://en.wikipedia.org/wiki/United_States][color=#0000ff]United States[/color][/url], with [url=http://en.wikipedia.org/wiki/Japan][color=#0000ff]Japan[/color][/url] winning the team contest.[url=http://en.wikipedia.org/wiki/Sudoku#_note-second_world_championship][color=#800080][30][/color][/url] [url=http://www.sudoku07.com/][color=#0000ff]official WSC 2007 website[/color][/url][/list]7?-DH_ c4mB1D/];Z

+f/{ Je:} D [[i] 本帖最后由 yzxjy 于 2007-7-5 15:46 编辑 [/i]]

咕咕!!~~~ 发表于 2007-6-2 18:21

[size=7][color=blue]俱乐部人员名单:[/color]#z$XLg0v4z_
[/size]2wT0r)U4~9O m8B
[color=royalblue][quote]
D#]4\Q8Ndr)t.r|4NW [size=3]原帖由 [i]RebeccaTao[/i] 于 2007-7-4 17:52 发表 [/size][/color][url=http://bbs.taisha.org/redirect.php?goto=findpost&pid=9045904&ptid=836703][size=3][color=royalblue][img]http://bbs.taisha.org/images/common/back.gif[/img][/color][/size][/url]
W| x s!Dz(p [color=royalblue][size=3]把在俱乐部里报过到的名单列一份,按回帖的先后顺序排的
DI BP+K*j*h1w#A;u 至于算不算会员嘛,还请3707定夺咯~~~~[/quote][/size][/color]S?W"T7W*Y@C
[color=royalblue]ujEm*EeO
[size=3]名单如下:/{a(BN`(a
[/size][b][size=3]3707 (倒立着看我名字~)
/K xp S}[ [/size][/b][b][size=3][color=royalblue]yzxjy (小笨笨鼠)
/kSZH1xp/`1o brianlai999
RrZ2{"_ v usher2004 (天才 忍者)[/color]q:_ n? N o
[/size][/b][/color][size=3][color=royalblue][b]kuding (蕊儿)[/b][/color][/size]
Sf]G*z-Bc [size=3][color=royalblue][b]
9Rc4`"V | dolphintx (田田)
(IF;{ |4g1FQ;B C RebeccaTao (静ison)[/b][/color][/size][color=royalblue][b][size=3][size=0px]`)U        Y:s3X
H)q%S~g.bY6g/y4| h[/size]!D'A+h2K8a Z
[size=0px]C@B[/size]
;zY4@g]9K9` 无敌小飞兔
'S8Q+[/z,MM yliu36 (水)
P(g)C(Ec-L [/size][/b][/color][url=http://bbs.taisha.org/space-uid-592809.html][size=3][color=royalblue][b]180987209[/b][/color][/size][/url][size=3][color=royalblue][b] (爬爬)[/b][/color][/size]k(t8m)y*hj
[size=3][color=royalblue][b]
Rn6K6NP&[f:X'Y TOP.1
r~9mV$w yfJ [/b][/color][/size][url=http://bbs.taisha.org/space-uid-452129.html][size=3][color=royalblue][b]ago1209[/b][/color][/size][/url][size=3][color=royalblue][b] (小刀一把)
o4D'W~:y,R KH A [/b][/color][/size][url=http://bbs.taisha.org/space-uid-729600.html][size=3][color=royalblue][b]huluoboyingzi[/b][/color][/size][/url]
(khB%s f'U [b][size=3][color=royalblue]学习?!~[/color]2W'H:y.`.o7|
[color=#4169e1]timeleaver[/color][/size][/b]
'L*ZQ@(GLtS)p~.k7_ [color=#4169e1][/color]
;kI2F\c+M|\ [size=3][b][color=#4169e1]汤汤汤汤~~~[/color]4p{ptwt
[/b][/size][url=http://bbs.taisha.org/space-uid-881819.html][size=3][color=royalblue][b]ヾ焍⒏爅爝尐[/b][/color][/size][/url][size=3][b][color=royalblue] (第八魔爵) [/color]t c$pP8vo
[/b][/size][url=http://bbs.taisha.org/space-uid-701043.html][size=3][color=royalblue][b]wngmv[/b][/color][/size][/url]
H Q5Jh3a*dy9j1W [url=http://bbs.taisha.org/space-uid-774837.html][size=3][color=royalblue][b]Rachel♀MINT[/b][/color][/size][/url]!D,p*R IU bT-[
[url=http://bbs.taisha.org/space-uid-829545.html][size=3][color=royalblue][b]iswitch[/b][/color][/size][/url]
5j&hO,Ni%]e
tAmul` [url=http://bbs.taisha.org/space-uid-600090.html][size=3][color=royalblue][b]烧包谷[/b][/color][/size][/url]B c:H*yg1GZNz
[url=http://bbs.taisha.org/space-uid-590595.html][size=3][color=royalblue][b]sqs2006[/b][/color][/size][/url][size=3][color=royalblue][b] (人王伏曦) [U)V`l-z"sF
[/b][/color][/size][url=http://bbs.taisha.org/space-uid-889567.html][size=3][color=royalblue][b]三月三的阳光[/b][/color][/size][/url][size=3][color=royalblue][/color][/size][url=http://bbs.taisha.org/space-uid-524896.html][size=3][color=royalblue][b]steven0527[/b][/color][/size][/url][size=3][color=royalblue][b] (天涯浪子)
D i3?Z\T^3m@ [/b][/color][/size][url=http://bbs.taisha.org/space-uid-890934.html][size=3][color=royalblue][b]我为IELTS狂[/b][/color][/size][/url][size=3][color=royalblue][/color][/size][url=http://bbs.taisha.org/space-uid-884322.html][size=3][color=royalblue][b]罂粟花开[/b][/color][/size][/url]9yiX-eqkiQ)n
[color=royalblue][b][size=3]zenith[/size][/b][/color][color=royalblue][b]1hSg+Q)u U d
[size=3]mcdream1lmcK(c!C
[/size][size=3][color=royalblue]xiaofeino1[/color][/size][/b][/color]1Q#e Gv l%A
[size=3][color=royalblue][b]vanlein[/b][/color][/size]
xtA(ai aL [size=3][color=royalblue][/color][/size]
R/`PLE)| [color=royalblue][size=3][color=royalblue][b]rogers-ren[/b][/color][/size][/color]u3op+w {~"N
[b][size=3][color=#4169e1]dakid11[/color][/size][/b]Qcl9b_/j7j"{e

zX5j}D.? [size=3][color=royalblue][/color][/size][size=7][color=red]刚开了个我们俱乐部的QQ群:43160243 大家互相转告PM一下 我去学习了 [/color][/size]
!SAruN3U
0O$T [cW%|`D [[i] 本帖最后由 yzxjy 于 2007-11-11 00:13 编辑 [/i]]

yzxjy 发表于 2007-6-3 04:20

[color=black][size=7][color=black][b][align=center]Example Puzzles and Solutions(样题)[/align][/b][/color][/size][/color][align=center]'y$d&rK8{6y
zz自[url=http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/examples.html]http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/examples.html[/url]
$IXpMSr)}[n [size=6][color=red][b]Easiest[/b][/color][/size] yd"x| ei-M X/E-X
1-1 Arizona Daily Wildcat: Tuesday, Jan 17th 2006[/align]~0W#j4vyfl
[table][tr][td][img]http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/wildcatjan17p.gif[/img] [/td][td][b]File[/b]: [font=新宋体]wildcatjan17[/font] [url=http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/wildcatjan17.txt][color=#0000ff]Steps[/color][/url] Solved in 73 steps. Uses only Heuristic 1: Simple row, column or 3 x 3 area inconsistency/insufficiency. )]Lin/ku0y^
[/td][td][img]http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/wildcatjan17.gif[/img] [/td][/tr][/table][align=center]
F{L J r]q @!} 1-2 Arizona Daily Wildcat: Wednesday, Jan 18th 2006m`by"|B4KNT
[/align][table][tr][td][img]http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/wildcatjan18p.gif[/img] [/td][td][b]File[/b]: [font=新宋体]wildcatjan18[/font] [url=http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/wildcatjan18.txt][color=#0000ff]Steps[/color][/url] Solved in 81 steps. Uses only Heuristic 1: Simple row, column or 3 x 3 area inconsistency/insufficiency. /Bp L3{D/F0x*H
[/td][td][img]http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/wildcatjan18.gif[/img] [/td][/tr][/table][align=center]
)C)bj)HGc [size=6][color=red][b]Intermediate[/b][/color][/size][/align][align=center]2-1 Daily Telegraph January 19th "Diabolical"[/align]h0C F JUb
[table][tr][td][img]http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/dtfeb19p.gif[/img] [/td][td][b]File[/b]: [font=新宋体]dtfeb19[/font] [url=http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/dtfeb19.txt][color=#0000ff]Steps[/color][/url] Solved in 178 steps. This is from the [i]Daily Telegraph[/i] newspaper archives at [url=http://www.sudoku.org.uk/][color=#0000ff]http://www.sudoku.org.uk[/color][/url]. Only requires Heuristics 1 and 2, i.e. simple consistency check for rows, columns and 3x3 areas, and the subset cover idea.
GhE x\%J-j [/td][td][img]http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/dtfeb19.gif[/img] [/td][/tr][/table][align=center]
o_ZETQ [size=6][color=red][b]Difficult[/b][/color][/size][/align][align=center]3-1 Vegard Hanssen puzzle 2155141This is puzzle number 2155141, the highest-rated puzzle (as of Jan 19th 2006) on the [url=http://www.menneske.no/sudoku/eng/top10.html][color=#0000ff]Top 10[/color][/url] list on Vegard Hanssen's webpage. 0s-I}4Eyv
[/align][table][tr][td][img]http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/v2155141p.gif[/img] [/td][td][b]File[/b]: [font=新宋体]v2155141[/font] [url=http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/v2155141.txt][color=#0000ff]Steps[/color][/url] Solved in 196 steps. It has only one step that is difficult (line 56). (See the description [url=http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/h1p.html#example1][color=#0000ff]here[/color][/url].) To get past line 55, it employs the boosted version of Heuristic 1 plus an assist from Heuristic 4. B2}"H3llPC
[/td][td][img]http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/v2155141.gif[/img] [/td][/tr][/table][align=center]3.2. Challenge 2 from Sudoku Solver by Logic[/align][table][tr][td][img]http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/challenge2p.gif[/img] [/td][td][b]File[/b]: [font=新宋体]challenge2[/font] [url=http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/challenge2.txt][color=#0000ff]Steps[/color][/url] Solved in 133 steps. This is [url=http://www.sudokusolver.co.uk/challenge2.html][color=#0000ff]Challenge 2[/color][/url] from Sudoku Solver by Logic. (See also the harder Challenge 1 below.) This puzzles requires multiple instances of Heuristic 1+ before succumbing to direct elimination methods. However, all of the inference chains are relatively easy to follow as they require no more than two pivots.
3Dj.sHR8V1[p [/td][td][img]http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/challenge2.gif[/img] [/td][/tr][/table][align=center][size=6][color=red][b]Hardest[/b][/color][/size]5_5ff.`;\y
[/align][align=center]4-1 Challenge 1 from Sudoku Solver by Logic[/align][table][tr][td][img]http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/challenge1p.gif[/img] [/td][td][b]File[/b]: [font=新宋体]challenge1[/font] [url=http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/challenge1.txt][color=#0000ff]Steps[/color][/url] Solved in 229 steps. This is [url=http://www.sudokusolver.co.uk/challenge1.html][color=#0000ff]Challenge 1[/color][/url] from Sudoku Solver by Logic. Under the default setting, the program gets to step 84 making liberal use of Heuristic 1+, i.e. chaining. To proceed further, you must set the 1+ limit, the length of the chains the program is allowed to use to derive a contradiction, to unlimited.
V;{\ lI7we;F [/td][td][img]http://minimalism.linguistics.arizona.edu/~sandiway/sudoku/challenge1.gif[/img] [/td][/tr][/table])M q B\chLe5U O)Z
$S9uX!E7\1K
[[i] 本帖最后由 yzxjy 于 2007-7-5 16:23 编辑 [/i]]

咕咕!!~~~ 发表于 2007-6-4 14:57

[size=7][color=blue]关于原创数独:[/color][/size]+[`3m9Ggj H3]6J_8Z
[size=3][color=blue][/color][/size]
5HpGl[6B [color=royalblue][size=3]如果有自编数独的 大家可以在这里发 算是试验版哦 记得出的题一定要符合数独的审美要求和答案的唯一性~~~[/size]
a/_*O]PS-F [size=3][/size]X6T| n Zy-^"A2J2o
[size=3][/size]
$J#Onu*vi/d [/color][size=3][color=blue][color=royalblue]数独像衣服一样 要手工的好 就是说要人工制作的 不知道软件做起来的怎么样
:h$q1QY,K3|7Vu
sieBy
yt'l6v)R1k*{i 偶梦想有天可以天天编数独...[/color]8t4x|ofX
[/color][/size]+h Q4p\-s%C,W
[size=3][color=blue](vO"UI8}2s h|
[/color][/size]原来内容:
LzO-Cg8S
II-k9nE:KiB` 恩 人是少了点。。。。
;A1s.JZ)M$v@ }R
:|(w.D E8c`u 可是觉得发在这里比较合适 其它学习的地方不能发这个 有的玩的版块灌水太多 不是偏题就是胡扯 不喜欢。。。 希望找到真正一样喜欢玩的人
0~QS8RF,Sf"?U+N'F .k-E5j5d y:{8t
[[i] 本帖最后由 3707 于 2007-7-5 15:02 编辑 [/i]]

咕咕!!~~~ 发表于 2007-6-4 20:28

[size=3][color=indigo][quote]最近看到可以要钱办活动 我们能不能也申请点太傻元办活动啊~
)U"y5{ y:qs Z)Jm*xQ\
比如定期出题 出题给钱或者威望(不然让斑竹出他怎么玩 要不大家轮流出?) (原创的应该多给点 可是这个不好判断..) 大家做出来的给钱 就像职民版那个活动 大家看过没? 不知道能否给数学版顺便招点人气
a hFS0XyY;M *H#wLzRg:ZeQ'B
要是想纯粹点 只是为真正热爱它的人的话 大家可以组建约个时间PK什么的 或者在这里大家一起自娱自乐 +j j[ Wt+T

*jB \p9s z"} 这就是我一直以来的想法~
NO)B,zDZsf0A qQA0u1u[C
还有很多 以后补充&}\d??
虽然这里人不是很多 但是这里依旧是我心爱的俱乐部~::12[/quote]
g"S'nl m Y(m{j+~
f ])^6E9Cf y
n(OB T4L
[quote]你们提的都很好,我们可以在网上或者书本里找些题目来,定期搞竞赛,不过还是先试行一次,看看大家的反应如何,来的人多的话,我们就继续举办下去,我也帮忙宣传宣传::16[/quote]A[-W;S%]-C;y

$e$J/^;T'C.S&G!z[
T_+MW:A [quote]我觉得每期可以分等级出题( 奖金分等级给就可以了) 也给新手们机会 而每人没此只能选一个回答 这样才能做到公平竞争 您觉得呢 老板~[/quote][/color][/size]
;^z$`1wA{ l [size=3][color=#4b0082][/color][/size]tr S2Bv#Y
[size=3][color=#4b0082][/color][/size]
)W%Z8q }4W!PB5bI [size=3][color=indigo][quote]目前还在筹划中[/color][/size][color=indigo][size=3][size=0px]太傻超级论坛[6M)E R)E*e&N M,f[8ms P
p
#ur*Rk#u$~ |f S*_[/size]
4u6E8v9Wv+b E(W 主办单位:数独俱乐部[size=0px]GRE,TOEFL,SAT,IELTS,GMAT,visa,USA,留学,签证,申请,美国,英国,加拿大,欧洲uh2a.v9|[/size]B\i9c'M O
承办单位:数独俱乐部,数学板块::11 [size=0px]5_k})H/K)?P^(E[/size]NB.s%r3_&uT
主办人:3707::16 ::80[/quote][/size][/color]
)[#a1UUg;z}+nh
8B#|aC!_)h8qM6l [[i] 本帖最后由 3707 于 2007-7-5 15:06 编辑 [/i]]

brianlai999 发表于 2007-6-5 08:51

算我一个~~

yzxjy 发表于 2007-6-5 11:20

支持支持!u,Pv qn7t h
可以举办一个club了

咕咕!!~~~ 发表于 2007-6-5 14:14

[size=3][color=blue]终于有人啦 大家想想我们的俱乐部都能玩些什么呢 或者讨论做题和出题技巧什么的 或者大家约个时间上些数独网同时做一个数独 比时间什么的 [/color][/size].~+nC0zn8JT

\%o1ze+H2XZ *ef VM/S*@&`9B

`i3nC,z4B
erFwpZ+g3b.l_ [size=3][color=blue]如果有自编数独的 大家可以在这里发 算是试验版哦 记得出的题一定要符合数独的审美要求和答案的唯一性~~~[/color][/size]

咕咕!!~~~ 发表于 2007-6-5 14:16

我把自己的签名那改了(虽然没有改醒目的颜色。。。  )但原这里的人能够越来越多哦~~&M1h4qB U[[ N[

z4p0b1YAy &k ~q~E;L+DpkK H
大家招招人哦~~~~

yzxjy 发表于 2007-6-5 15:20

最好直接改成一个链接形式a0[ k!bQ2V:Z }C)B"r
现在还是不太方便

咕咕!!~~~ 发表于 2007-6-5 15:31

昨天没弄好 已经改了~~~

usher2004 发表于 2007-6-17 19:18

*** 作者被禁止或删除 内容自动屏蔽 ***

咕咕!!~~~ 发表于 2007-6-17 19:46

不会来找我吧 哈哈~真的哦

yzxjy 发表于 2007-6-18 01:48

偶这边数独大致上有两种分法,一种是5星(估计就是楼上的楼上的看到的),另一种就是3星(容易,普通,困难)
|i qFge JR 偶有个同学只做4星以上的,一般一节课搞定,很nb:loveliness:
]1B3]PF.a3IIg H 俺就不行了,4星要花费至少一个多小时::18
)CHQid9Mn d| 5星很少登,校报给的大多是3星半,四星,有时候会添加一个一星两星::11

咕咕!!~~~ 发表于 2007-6-18 11:58

不清楚楼上说的 我是玩那本黄的 快的7或8分钟 正常十几分钟 有时碰到郁闷的就不知道了

咕咕!!~~~ 发表于 2007-6-18 12:12

我那本黄的似乎不是太好 还有好几本忘了颜色了!P:I3\ @ v1e!z(J4e

RS1[7a}a2? 不过不敢买新的 一买我就不学习了
.bA)z&W|9p8z3w-}
&?%R4_(T7{t $CP}J%?:]3y Htk^
上次英国有期杂志就是专门玩数独的

usher2004 发表于 2007-6-18 12:57

*** 作者被禁止或删除 内容自动屏蔽 ***

usher2004 发表于 2007-6-18 13:00

*** 作者被禁止或删除 内容自动屏蔽 ***

咕咕!!~~~ 发表于 2007-6-18 17:00

干吗贴答案呢 让大家做啊~

usher2004 发表于 2007-6-18 19:56

*** 作者被禁止或删除 内容自动屏蔽 ***

yzxjy 发表于 2007-6-19 03:54

第一次做数独得时候,足足做了两个小时才搞定一个
!PIZi^2T$m 确实很有意思::11

咕咕!!~~~ 发表于 2007-6-20 13:30

我来试试你这题 看看要多久 几个月没做过 快没感觉了~

kuding 发表于 2007-6-22 01:49

这个东西接触的蛮晚的,就是还没入门的感觉,容易得还是会的,难的就要推敲个半天

咕咕!!~~~ 发表于 2007-6-22 15:34

回复 #25 kuding 的帖子

慢慢学 不会大家教你啊 会的大家切磋谈谈~

usher2004 发表于 2007-6-23 10:44

*** 作者被禁止或删除 内容自动屏蔽 ***

dolphintx 发表于 2007-6-27 20:18

哈哈,我还挺喜欢的,只是自从我发现我除了初级的可以完成,中级的能做完一些,高级的想也不用想之后就失去信心了

咕咕!!~~~ 发表于 2007-6-29 11:13

最近比较忙烤鸭 考试完再回来和大家聊 SORRY...

RebeccaTao 发表于 2007-6-29 19:27

我也爱数独,超爱的那种!!!!!
1d_:AJ%L!C 上课也狂做的哦

咕咕!!~~~ 发表于 2007-6-30 11:34

回复 #30 RebeccaTao 的帖子

同路人~~~

RebeccaTao 发表于 2007-6-30 13:21

回复 #31 3707 的帖子

呵呵,那是,那时候专门买了本数独的书来做6LdjLGPmm
现在下了一个软件做#Z%w*Lk+P
哈哈

咕咕!!~~~ 发表于 2007-6-30 14:08

回复 #32 RebeccaTao 的帖子

刚才发错信息给你了 SORRY
| PciqH%U ?IQW4j 's3I P7Z#y$l
;ss0V-i.gH.Yv4@
听说数独像衣服一样 要手工的好 就是说要人工制作的 不知道软件做起来的怎么样
,m] el'E!VqprdB HyfxU"L0x_:e
7Z6w5zXS1fn,\
梦想有天可以天天编数独...
2l/d \Gq(E@ T nU9X+a#eW&_q|
0S/z D L!k#H9ei\
有空找个网站比比时间吧~5F!\`(HPx6Jk/`

[5j;sEA%qs
8Oed OP-e 有空找个

南极光 发表于 2007-6-30 20:44

变化太少 不够刺激

无敌小飞兔 发表于 2007-6-30 22:45

恩  比较简单的  无聊的时候做做

yzxjy 发表于 2007-7-1 00:06

[quote]原帖由 [i]RebeccaTao[/i] 于 2007-6-29 19:27 发表 [url=http://bbs.taisha.org/redirect.php?goto=findpost&pid=9013944&ptid=836703][img]http://bbs.taisha.org/images/common/back.gif[/img][/url]5T!}$Hho:c)SV*jm s
我也爱数独,超爱的那种!!!!!
rI-HsU [size=4][color=blue]上课也狂做[/color][/size]的哦 [/quote]/bz*PT Uofi Y
看来确实是超级爱::11

yzxjy 发表于 2007-7-1 00:10

[quote]原帖由 [i]3707[/i] 于 2007-6-30 14:08 发表 [url=http://bbs.taisha.org/redirect.php?goto=findpost&pid=9018864&ptid=836703][img]http://bbs.taisha.org/images/common/back.gif[/img][/url]
.Ii*G?/^H(g 刚才发错信息给你了 SORRY
/G!}5RPxE3g7I
wExGA'].Ur,G^
.}yY;lZg3rn^ `.d 听说数独像衣服一样 要手工的好 就是说要人工制作的 不知道软件做起来的怎么样0_;s ?`'p(_ h2N
nSNor
%Y r'w _ }F'GAxB
梦想有天可以天天编数独...THChd3g|

hj {%Q `K3@jD #aZI.yN(mcy
有空找个网站比比时间吧~&VI7OI*h
/_$J5St'Mf4ov f
1t"ZEq0m
有空找个 [/quote]}$Hg i5m o;{
以前有个朋友比较喜欢在网上做,不过我和你一样,更喜欢用纸笔做::83 g7tDc*z2[ I
不过编数独我倒没想过,不知道其中的技巧::z2

咕咕!!~~~ 发表于 2007-7-1 11:24

回复 #37 yzxjy 的帖子

我正在努力尝试中...

咕咕!!~~~ 发表于 2007-7-1 11:30

等我烤鸭完毕 一定回来重新把这里打理好::16

yzxjy 发表于 2007-7-1 13:06

好好整理一下,做一个club::31

页: [1] 2 3 4 5 6 7 8 9 10

Powered by Discuz! Archiver 6.1.0  © 2001-2007 Comsenz Inc.