Diagonalization: Difference between revisions
Content added Content deleted
No edit summary |
Leveloneknob (talk | contribs) mNo edit summary |
||
Line 1: | Line 1: | ||
{{Extraction Sidebar}} |
|||
: ''The real numbers are uncountable and the halting problem is undecidable.'' |
|||
The nice thing about squares is that they have a diagonal. By extension, if you have a square of letters — usually by having obtained ''n'' words that are all ''n'' letters each — it’s often worth looking at the diagonal of that. |
The nice thing about squares is that they have a diagonal. By extension, if you have a square of letters — usually by having obtained ''n'' words that are all ''n'' letters each — it’s often worth looking at the diagonal of that. |
||
Line 5: | Line 5: | ||
:<span style='font-family: monospace'>'''A'''LIENS<br>E'''N'''OUGH<br>BU'''S'''TER<br>BLO'''W'''UP<br>HARV'''E'''Y<br>BENHU'''R'''</span> |
:<span style='font-family: monospace'>'''A'''LIENS<br>E'''N'''OUGH<br>BU'''S'''TER<br>BLO'''W'''UP<br>HARV'''E'''Y<br>BENHU'''R'''</span> |
||
== |
== Notable Examples == |
||
''(add puzzles that use this element here)'' |
Revision as of 17:43, 11 June 2022
Part of a series on |
Extraction |
---|
The nice thing about squares is that they have a diagonal. By extension, if you have a square of letters — usually by having obtained n words that are all n letters each — it’s often worth looking at the diagonal of that.
- ALIENS
ENOUGH
BUSTER
BLOWUP
HARVEY
BENHUR