## About page.title

The first page.title puzzle was made by @Eszter in 2022, including the constraint that no two triangles on adjacent hexagons be the same size. In November 2023, @Endagorion independently re-created this genre, but without that original constraint.

This implementation starts with the smaller ruleset as the base genre. Two variants were added:
- ´´unequal-adjacent-loop-vertices´´ : no vertices of equal triangles may be adjacent
- ´´unequal-adjacent-loops´´ : no two adjacent cells may belong to two distinct, equally-sized loops

V=unequal-adjacent-loops

V=unequal-adjacent-loop-vertices



## page.title puzzles

### @Eszter
W=8x8x8&L=x0x6x14x8x19x3x14x11x3x2x8x2x4x9x3x2x2x8x15x11x3x6x5x1x4x4&G=tring-tring&A=echoes&T=triangles&V=unequal-adjacent-loop-vertices&F=2&K=Random8
((A=Echoes))

### @Endagorion
W=5x5x5&L=x12x16x13x6x3x1x5x3x1&SS=4WUR5EDDDLLLEE23LDE7LED7LED8WRWWWWWUWWUWUURRWUURRDELUUURRRDELURR1ELD&X=x16x1x1x8x7x4x27x7x6x12x2x8x12x5x3x4x7x3x6x9x2x9x9x2x5x9x2&G=tring-tring&A=endagorion&T=Tring_Tring
W=6x7x6&L=x0x1x1x7x5x4x2x1x9x2x3x9x2x10x12x12x6x6x8x1&SS=10URW1UWR1LEEEEDDDDLLL15LED1DEEEEEELLDEEELLLDDEDDDDLLLLEEELLLLDDDDD17LED30DLLEED1DDLLLEEED9URW10DLE4LDLLLLEEEEDDDLEEDD&G=tring-tring&A=endagorion&T=Tring_Tring:_Equilateral_Thinking
W=8x8x8&L=x13x12x4x8x4x3x17x1x21x2x10x11x1x6x3x8x27x11&G=tring-tring&A=endagorion&T=Tring_Tring:_Super_Hexagon
W=9x9x7&L=x0x1x1x1x1x1x1x1x1x1x1x1x1x1x1x2x1x1x1x1x1x2x1x1x1x1x1x3x1x1x1x1x1x3x1x1x1x1x4x1x1x1x1x4x1x1x1x2x3x1x1x1x5x1x1x2x4x1x1x2x2x2x1x7x1x4x3x7x1x2x2x2x1x6x1x1x5x1x1x5x1x1x1x4x1x1x1x4x1x1x1x1x3x1x1x1x3x1x1x1x2x1x1x2x1x1x1x1x1x1x1x1&G=tring-tring&A=endagorion&T=Tring_Tring:_Wait_For_It
((A=Endagorion))

### site.author

A small example:
W=3x4x4&L=x2x1x2x1x2x14x4x2&SS=4LDE6DEELURRRWWWUULD6LDDEEL&D=05-11-2023&T=Example&G=tring-tring
((sited))

Two puzzles with the Unequal Adjacent Loop Vertices constraint:
W=8x8x8&L=x11x15x23x2x11x13x7x1x2x17x10x7x8x7x24x3x6&SS=22URW5DDDDLLLLEEEE15URW17DDLLLEEED2DLLLEEEDD3URRWWU27LLLLLERRRWWWWWWUUUUUURDEELLDRREEEEDDDDD8URW4LEEDDL2LEEDDL17EEEELLDEELLDLLDDDD11URW16URW2DDLLEE1WWWWWWWWWUUUUUUUUURRRRRDEEEEELLLLLDDDDRRRR13LED3WWWWWUUUUURRRRR&V=unequal-adjacent-loop-vertices&D=2023-11-09&T=Ice_crystals&F=4&K=Endagorion&G=tring-tring
W=5x6x6&L=x0x3x2x1x3x1x4x1x1x3x1x1x3x1x1x4x1x1x3x1x1x3x1x1x5x6x6x2x3x1x1x3x1x2x1x3x2&SS=8WDLEUREDL19EEELLWWURRUURWLDDD25WRRUUW2LDE6UUWWRR2LDE9URRWWU&V=unequal-adjacent-loop-vertices&D=2023-11-14&T=Glitch&K=PinkHoodie&G=tring-tring
((sited))

### @PinkHoodie
A puzzle with the Unequal Adjacent Loops constraint: 
W=8x8x9&L=x2x3x2x1x6x2x4x6x1x3x2x8x5x14x1x7x6x2x2x4x4x19x3x3x2x8x5x21x9x7x4x7x4x3x2x1&V=unequal-adjacent-loops&G=tring-tring&A=PinkHoodie&F=2&T=Holey_Honeycomb&D=29-11-2023

A classic puzzle:
W=12x16x16&L=x12x5x3x8x2x5x1x13x27x7x6x7x1x11x6x6x13x6x2x8x2x6x6x2x7x2x5x4x6x1x4x7x6x5x15x11x4x3x12x3x5x5x2x4x1x8x2x9x6x2x4x8x2x9x5x2x2x2x15x5x9x11x9x9x2x8x6x3x2x5x8x1x9x4x3x6x19x2x1x6x4x4x15x3x13x11x12x7x17x3x1x8x3x2&G=tring-tring&F=3&A=PinkHoodie&T=Misconceptions&D=2023-12-09

V=unequal-adjacent-loop-vertices

And an ´´unequal-adjacent loop-vertices´´:
W=5x5x5&L=x7x7x9x1x2x3x2x19&SS=8UWR8ELLLDDDEE2LDDEEL2WWRRRRUUUUWW21LDE10UUWWRR7LDE2UUUWUWWREDLWRRR&V=unequal-adjacent-loop-vertices&G=tring-tring&A=PinkHoodie&D=2024-03-27&F=2&O=Enigmarch_2024&T=Rule_That_Got_Confused


## Acknowledgements
**2023-11-12** Thanks to @Endagorion and @Echoes for substantial feedback during the week, and for listing their original puzzles!
**2023-11-14** Thanks to @PinkHoodie for discovering an implementation glitch, that lead to the creation of a variant of a variant.
**2023-11-23** Some variants had been applied incorrectly, leading to zero or multiple solutions, as pointed out by @Random8 - thank you! 
**2023-11-23** Variant unequal-adjacent-loops further clarified (@PinkHoodie)
**2023-11-29** A puzzle using with the unequal-adjacent-loops variant was sent by @PinkHoodie
**2023-12-16** @PinkHoodie sent a classic puzzle, large size - thank you!
**2024-03-29** A smaller classic was shared by @PinkHoodie - thank you!