private void SearchGroupedLink()
{
try{
UGrCells[] LQ = new UGrCells[3];
for (int no = 0; no < 9; no++)
{
int noB = 1 << no;
Bit81 BPnoB = new Bit81(pBDL, noB);
//------------------------------------------
for (int tfx = 0; tfx < 18; tfx++)
{
Bit81 BPnoB2 = BPnoB & pHouseCells[tfx];
List <Bit81> houseLst = new List <Bit81>();
List <int> tfxLst = new List <int>();
for (int k = 0; k < 9; k++)
{
int hx = (tfx < 9)? (k + 9): k;
Bit81 BX = BPnoB2 & pHouseCells[hx];
if (BX.IsZero())
{
continue;
}
houseLst.Add(BX);
tfxLst.Add(hx);
}
for (int k = 0; k < 3; k++)
{
int hx = (tfx < 9)? (tfx / 3 * 3 + k): ((tfx - 9) / 3 + k * 3);
hx += 18;
Bit81 BX = BPnoB2 & pHouseCells[hx];
if (BX.IsZero())
{
continue;
}
houseLst.Add(BX);
tfxLst.Add(hx);
}
if (houseLst.Count < 2)
{
continue;
}
Permutation prm = new Permutation(houseLst.Count, 2);
while (prm.Successor())
{
int na = prm.Index[0], nb = prm.Index[1];
Bit81 HA = houseLst[na];
Bit81 HB = houseLst[nb];
if (!(HA & HB).IsZero())
{
continue;
}
UGrCells LA = new UGrCells(tfxLst[na], no);
UGrCells LB = new UGrCells(tfxLst[nb], no);
foreach (var P in HA.IEGetUCeNoB(pBDL, 0x1FF))
{
LA.Add(P);
}
foreach (var P in HB.IEGetUCeNoB(pBDL, 0x1FF))
{
LB.Add(P);
}
SetGroupedLink(tfxLst[nb], W, no, LA, LB);
if (!(BPnoB2 - (HA | HB)).IsZero())
{
continue;
}
SetGroupedLink(tfxLst[nb], S, no, LA, LB);
}
}
//------------------------------------------
for (int tfx = 18; tfx < 27; tfx++)
{
int bx = tfx - 18;
int b0 = (bx / 3 * 27 + (bx % 3) * 3); //Cell number at the top left of the block
Bit81 BPnoB2 = BPnoB & pHouseCells[tfx];
List <Bit81> houseLst = new List <Bit81>();
List <int> tfxLst = new List <int>();
for (int k = 0; k < 3; k++)
{
int r0 = (b0 / 9 + k);
Bit81 BX = BPnoB2 & pHouseCells[r0];
if (BX.IsZero())
{
continue;
}
houseLst.Add(BX);
tfxLst.Add(r0);
}
for (int k = 0; k < 3; k++)
{
int c0 = (b0 % 9) + k;
Bit81 BX = BPnoB2 & pHouseCells[c0 + 9];
if (BX.IsZero())
{
continue;
}
houseLst.Add(BX);
tfxLst.Add(c0 + 9);
}
if (houseLst.Count >= 2)
{
Permutation prm = new Permutation(houseLst.Count, 2);
while (prm.Successor())
{
int na = prm.Index[0], nb = prm.Index[1];
Bit81 HA = houseLst[na];
Bit81 HB = houseLst[nb] - HA;
if (HB.IsZero())
{
continue;
}
UGrCells LA = new UGrCells(tfxLst[na], no);
UGrCells LB = new UGrCells(tfxLst[nb], no);
foreach (var P in HA.IEGetUCeNoB(pBDL, 0x1FF))
{
LA.Add(P);
}
foreach (var P in HB.IEGetUCeNoB(pBDL, 0x1FF))
{
LB.Add(P);
}
SetGroupedLink(tfxLst[nb], W, no, LA, LB);
if (!(BPnoB2 - (HA | HB)).IsZero())
{
continue;
}
SetGroupedLink(tfxLst[nb], S, no, LA, LB);
}
}
if (houseLst.Count >= 1)
{
for (int na = 0; na < houseLst.Count; na++)
{
Bit81 HA = houseLst[na];
UGrCells LA = new UGrCells(tfxLst[na], no);
foreach (var P in HA.IEGetUCeNoB(pBDL, 0x1FF))
{
LA.Add(P);
}
foreach (var rc in BPnoB2.IEGet_rc())
{
if (HA.IsHit(rc))
{
continue;
}
UGrCells LB = new UGrCells(-9, no, pBDL[rc]);
SetGroupedLink(tfxLst[na], W, no, LA, LB);
SetGroupedLink(-9, W, no, LB, LA);
}
}
}
}
}
}
catch (Exception ex) {
WriteLine(ex.Message);
WriteLine(ex.StackTrace);
}
}
