We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.

Talk:Smolder

From Esolang
Jump to navigation Jump to search

I'm having a lot of trouble trying to come up with a way to turn one number into another. there's probably an intuitive way to do it, I just don't know enough to figure out how, partly since the changes are symmetric —aadenboy (talk|contribs) 01:55, 22 May 2025 (UTC)

so it turns out that for some numbers it's actually impossible to reach another number, and you end up with these "groups" of nodes that can be reached from a starting node

Connection graphs for
101
and
202
respectively
this is honestly really interesting and I'll need to spend some more time tinkering with this revelation, but it's also slightly infuriating —aadenboy (talk|contribs) 20:01, 29 May 2025

full graph. seems like they all converge to the
002
222
133
313
311
131
which is self contained, alongside the
000
and
220
dead ends. all groups can only traverse inside its group via single-cell transformations, and go down towards the self-contained ring via combinations. the self-contained ring is the only ring that can stay inside of its ring through both transformations
all of the cells in this group are optimal for computations —aadenboy (talk|contribs) 19:52, 30 May 2025 (UTC)
it's extremely symmetric —aadenboy (talk|contribs) 16:35, 16 September 2025 (UTC)

?

You specification for this language is, not to be rude, very hard to understand, because you dont assign what subscripts implies what cell. It would be nice if you actually defined that on the page. --Yayimhere2(school) (talk) 09:29, 30 December 2025 (UTC)

I've reworded the introduction slightly to be more clear about what each variable means. in general, "b", "g", and "r" refer to the blue, green, and red channels —aadenboy (talk|contribs) 17:40, 30 December 2025 (UTC)
Ill check, though note I meant the subscript on each color channel(because the colors were obvious enough by themselves). but yea ill read it. --Yayimhere2(school) (talk) 18:52, 30 December 2025 (UTC)
There seems to be some display errors. --Yayimhere2(school) (talk) 18:53, 30 December 2025 (UTC)
the errors are from the math api itself—they'll usually go away on their own or with a quick refresh by purging the cache of the page —aadenboy (talk|contribs) 19:37, 30 December 2025 (UTC)
Hm. k --Yayimhere2(school) (talk) 19:50, 30 December 2025 (UTC)

Rule 110 implementation

I decided to try my hand at a rule 110 implementation in a similar style to Burn after finding the implementation at the bottom of the article. Unless I made an error in testing, I think this works:

22
22
22
22
22
22
10
31
10
22
11
22
10
31
22
31
22
31
31
22
31
31
22
22
22

An "on" signal begins as a 002 where the topmost 22 is (and the "off" signal is no change). Breaking down some interactions:

Initial state (X + Y)
X
Y
22
22
10
22
22
31
0 + 0
22
22
22
22
10
22
22
31
1 + 0
002
311
002
002
131
311
131
131
1 + 1
002
002
002
002
133
002
002
133
Initial state (X >= 1, X == 2)
X
31
31
31
10
31
31
22
22
22
0 >= 1, 0 == 2
31
31
31
31
10
31
31
22
22
22
1 >= 1, 1 == 2
131
131
131
131
000
131
002
22
002
22
2 >= 1, 2 == 2
133
133
133
133
002
133
002
002
002
002
Initial state (X AND Y)
X
Y
22
22
11
22
22
22
0 AND 0
22
22
22
22
11
22
22
22
1 AND 0
002
22
002
002
000
22
22
22
1 AND 1
002
002
002
002
002
002
002
002
Initial state (X XOR Y)
X
Y
22
22
22
22
22
22
0 XOR 0
22
22
22
22
22
22
22
22
1 XOR 0
002
002
002
002
002
002
002
002
1 XOR 1
002
002
002
002
000
002
002
22

This implements (L & C & R) ^ (C | R) rather than (not (L & C & R)) & (C | R), but they're equivalent. –PkmnQ (talk) 14:29, 28 June 2026 (UTC)

I may try seeing if I can manage anything using 002 and 222 as on/off signals rather than 002 and no change, or try some completely different set of states entirely, but currently I'm satisfied with this construction. –PkmnQ (talk) 14:34, 28 June 2026 (UTC)
WOW!!! I am so impressed!! I thought it might not be possible (esp logic gates besides XOR) but you proved me wrong :D! once I get time I'll poke at this some more cause these are really nice solutions with the minimal set —aadenboy (talk|contribs) 19:23, 28 June 2026 (UTC)
Retrieved from "https://esolangs.org/w/index.php?title=Talk:Smolder&oldid=184726"