مكتبة التقنيات

كل تقنية، مشروحة.

44 تقنية في ثماني عائلات، لكل منها شرح مكتوب وأمثلة يمكنك تتبّعها خطوة بخطوة. لا ترتيب مفروض — إن أظهر لك الحلّال للتو تقنية Sue de Coq، فابدأ منها.

0 / 44 مقروء

تفضّل اتّباع المنهج؟ افتح مسار التعلّم — سيختار لك الترتيب.

الأساسيات

تقنيتان · لا شيء مقروء

المنفردات

3 تقنيات · لا شيء مقروء

المرشحون المحصورون

تقنيتان · لا شيء مقروء

المجموعات الجزئية

4 تقنيات · لا شيء مقروء

الأسماك

3 تقنيات · لا شيء مقروء

الأجنحة

3 تقنيات · لا شيء مقروء

السلاسل والتلوين

20 تقنية · لا شيء مقروء
Simple ColoringFollow one digit through every house where it has exactly two places, and color the cells in two. One color holds the digit everywhere. How to build the chain, the two ways it removes candidates, and why three places break a link.صعبقراءة 9 دX-ChainFollow one digit along links that alternate strong and weak, from a strong link to a strong link. At least one end holds the digit, so a cell that sees both ends loses it. How to build the chain and where a weak link cannot go.خبيرقراءة 9 دX-Chain Cell GroupsAn X-chain with cell groups lets two or three cells of one box stand as a single node. That carries the chain through a box with three places for the digit. How to build one, why a group links like a cell, and the group that breaks it.خبيرقراءة 9 دShort AICA short AIC is the shortest X-chain: two strong links on one digit, joined by a weak link. Four cells, three links, and any cell that sees both ends loses the digit. How to find one by pairing strong links, and the pair that fools you.خبيرقراءة 8 د
Short AIC Cell Groupsسيتوفر لاحقًاخبيرقراءة 8 د
XY-ChainAn XY-chain links cells with two candidates. Inside each cell one digit or the other is true, and the digit passed between cells changes as you go. One end holds the digit both ends carry. How to build one and the cell that breaks it.خبيرقراءة 9 د
XY-Chain Cell Groupsسيتوفر لاحقًاخبيرقراءة 9 د
AICAn AIC, or alternating inference chain, links candidates with strong and weak links in turn. Strong links run between cells or inside one, so the digit can change. When both ends carry the same digit, one holds it. How to follow one and the two-ends rule.خبيرقراءة 10 دAIC Cell GroupsA grouped AIC is an alternating inference chain where one node can be two or three cells in a box. The group turns a house with three places into a strong link. A worked chain, how group nodes link, and the two-ends rule.خبيرقراءة 10 د3D Medusa3D Medusa colors candidates, not cells, so the color can pass from one digit to another inside a cell with two candidates. How to build the cluster step by step, the three color rules, and what it adds to simple coloring.خبيرقراءة 8 دX-CycleAn X-cycle is an X-chain that closes into a loop on one digit. When the links alternate all the way round, every weak link strikes. When two weak links meet at one cell, that cell loses the digit. A worked loop and a quiz.خبيرقراءة 9 د
X-Cycle Cell Groupsسيتوفر لاحقًاخبيرقراءة 9 د
XY-CycleAn XY-cycle is an XY-chain that closes into a loop of cells with two candidates. Every link between its cells has its digit at one end, so each one can strike. A worked six-cell ring, how it differs from an XY-chain and an X-cycle, and a quiz.خبيرقراءة 9 د
XY-Cycle Cell Groupsسيتوفر لاحقًاخبيرقراءة 9 د
Bi-Directional Cycleسيتوفر لاحقًاخبيرقراءة 10 د
Bi-Directional Cycle Cell Groupsسيتوفر لاحقًاخبيرقراءة 10 د
NishioNishio tests one candidate: assume it, fill in only the singles it forces, and strike it if the grid breaks. A worked trial with two forced digits, the three ways a trial breaks, and why it is not guessing.خبيرقراءة 8 دDigit Forcing ChainA digit forcing chain follows one candidate as true and as false, with singles only, and keeps whatever both branches agree on. A worked example, how it differs from Nishio, what the in-game hint shows, and a quiz.خبيرقراءة 10 دCell Forcing ChainA cell forcing chain tries each candidate of one cell as its value, tracks each with naked and hidden singles, and strikes any candidate every branch removes. With a worked three-candidate example, its ties to digit and unit forcing, and a quiz.خبيرقراءة 10 دUnit Forcing ChainA unit forcing chain puts one digit in each place it has in a row, column or box, follows each with singles only, and keeps what all the branches agree on. Includes a worked example, a comparison with digit forcing and Nishio, and a quiz.خبيرقراءة 10 د

ALS والتقنيات النادرة

7 تقنيات · لا شيء مقروء
BUG+1BUG+1, the bivalue universal grave plus one: when every empty cell has two candidates but one, the digit seen three times in that cell's houses goes in. A worked grid, why it needs a puzzle with one solution, and how to spot it.صعبقراءة 5 دRestricted Common CandidateAn almost locked set is N cells in one house with N + 1 candidates. Two of them with a restricted common candidate (ALS-XZ) remove a shared digit. A worked grid, the link to Y-wings and naked subsets, and a quiz.خبيرقراءة 8 دAligned Pair ExclusionAligned pair exclusion lists every combination two cells that see each other could take, strikes the ones a repeated digit, a bivalue cell or an almost locked set rules out, and removes a candidate left in none. Worked grid and quiz.خبيرقراءة 8 د
Aligned Triple Exclusionسيتوفر لاحقًاخبيرقراءة 9 د
ALS ChainAn ALS chain links almost locked sets through restricted common candidates, a new digit at each joint, and removes a digit both end sets hold. A worked grid, why it works, its link to XY-chains and Y-wings, and a quiz.خبيرقراءة 10 دSue de CoqSue de Coq pairs two cells where a line crosses a box with a bivalue cell in the line and another in the box, then clears digits from both houses. A worked grid, why it works, its link to the rcc move, and a quiz.خبيرقراءة 10 دDeath BlossomA death blossom gives a stem cell one almost locked set per candidate, then removes a digit every petal holds. The two-petal form, a worked three-petal grid, why it works, and a quiz.خبيرقراءة 11 د