farpointer from Wisconsin

Gooday and welcome.I hope you really like the site,as much as I do.

cool morning here near Chicago and today is my bowling day - enjoy your time on the site, Mary

Welcome to Sudokuland farpointer! Hope you enjoy your page and your time here. Cheers!

Welcome to Sudokuland Farpointer.

Farpointer!
I hope you enjoy yourself here. It really is a fun place, with great people.

(48)dg31::(3)d3={2(d3)=(2)g3} ...=f} -ded~(z) sees (2(d3), f)

A == ExpandoBool-- B == C

AUR(n)::A = { ExpandoBool expansion } - B = C

B is an elimination produced by { ExpandoBool expansion } ie. B - { a = b - c = d } - B

link A == EXB is a new class DerivedStrongLink which contains the AUR info etc.

chain search will require a new sub-process that generates short expansions.
these chains will be stored on the Expando bool with references to outer chain where used.
- better: class ExpandoChain refences two outer set bools - then FChain can be generated
correctly.

ExpandoBool
a) (n)x == (n)y
b) (n)x == (m)x

inside one or two corners of an AUR x or x, y
the ExpandoBool always has a strong link EXB == (p)y which only occurs as triplet or quad in corner.
thus : (npuv)y or (puv)y
ExpandoBool not required when corners are (puv)x -- (quv)x
here strong link (p)x == (q)y is direct.

the ExpandoBool's job in a chain, is to generate (if possible) a short chain with an exclusion
deduduction that becomes it's weak link in the outer chain.
direct possibilities for this link are u,v with (b) and peer n with (a).
These if exist can be tried first.
obviously if n is already locked into x and y no deductions are possible (or no added value is
obtained using EXB the link is already strong. nothing gained by True == (p)y ... only complexity is
added)

(note: an AUR is only one possible source for ExpandoBool - others may exist)

The really cool thing about this site is how nice and courteous everybody is. And how patient people are in explaining things and trying to accept what the other person is saying.

You might try getting into it.

Regards,
Brenda

See answer to your comment http://www.sudoku.com.au/1V13-6-2010-sudoku.aspx

That is a great puzzle site. Thanks again.

testing

//note these three can actually be any tri_sis[A, B, C] not just ZSet variety based on CellBools
//the same construction logic holds.
CellBool _sisA;
CellBool _sisB;
CellBool _sisC;
// W == w -- _sisC == { X == x -- _sisA == _sisB -- y == Y } -- u == U
// W == w
// X == x
// Y == y can either exist or not
// Deductions go from W == U; or _sisC == U .. this relation may be wrapped or even a perfect loop.
// u is discovered by examining the KNodes { X == x -- _sisA & Y == y -- _sisB }
// Required is some ISetBool u weak with both X = Y or { X = _sisA, Y = _sisB, _sisA = _sisB }.
// If X = Y are wrapped, u can also be found in the wrap deduction set of the inner chain based on _sisA, _sisB
// ie. since unwrapped u -- { x -- _sisA } is empty assertion, when wrapped x == _sisA and u is weak.
// the KrakenNode derivations KSingleNode, KDoubleNode, KTrueNode, KWrappedNode are all special cases of
// this generalized KChainNode construct.

farpointer, I have had a few requests to ask you to please refrain from getting unpleasant in your responses on the Tough page. I refer you to the creed of this site, as stated by Gath from the beginning - 'be nice to each other - you don't have to agree, but this is not the place for personal attacks'. If I continue to have your comments brought to my attention, I will have no choice but to disable your ability to post comments.

1.UP=21
2.SF(4):f9=h9-h5=b5-b1=f1 => b26,f8,h68<>4
3.kraken row(3)acd6 => ef8<>2,a8<>9,hi7<>5 UP=26
(3)a6-(13)ab2=XW(5)ab29-ab5=XW(5)hi15-hi8=(29)hi8
||
(3-4)c6=g6-(4=259)ghi8
||
(3)d6-(3=8 )d9-d2=(*68)ei2-(4)e2=e8-(4=259)ghi8
4.(4=5)e8-d7=(*15)d23-(8)d2=(*68)ei2 => e2<>4 UP=55.
5.FSF(8):f5=e6-e2=i2 => i5<>8 STE.