From Esolang
Jump to: navigation, search


How do the loops work? Does it loop while the current pixel is set (like Brainfuck)? Also, is it possible to unset a pixel? --Marinus 00:01, 18 September 2010 (UTC)

It looks by the code that it repeats eleven times and that there is no way to unset a pixel. I think both things should be corrected. --Zzo38 10:42, 25 October 2010 (UTC)

Currently, the loops just do the same code 10 times, I'm trying to find annother way for making loops more customizable, like define a variable for the max loop count. OR i could make so that Arrow always loops to a direction as long as it's not touching the end of the picture. The loop function would be like a while command. (Sorry for my bad English) --Fallensn0w 07:40, 4 March 2011 (UTC)

I think it would make more sense to make it loop while the pixel is set, and make it automatically unset the pixel at the beginning of the loop (unless it is red). --Zzo38 08:59, 4 March 2011 (UTC)
Well, yes, or maybe I should implement both, a while command would be usefull. --Fallensn0w 10:24, 4 March 2011 (UTC)
Because just [^>#](10) isn't esoteric enough, right? Also, in what way is this a BrainEff derivative? --Lobstopus (talk) 14:39, 9 March 2013 (UTC)
I was thinking about making the loop statement work like this: The code within the brackets will keep on looping until the pixel that the loop originally started from isn't black. Also I have ask, what is this "BrainEff" you are talking about? I'm confused. The reason I'm not making the loop work like you stated above is because [^>#](10) looks simply too obvious for me. --Fallensn0w (talk) 16:57, 10 March 2013 (UTC)
Of course. And by BrainEff, I mean BrainF***. I don't see any BrainEff-like (see?) code in here... --Lobstopus (talk) 16:31, 11 March 2013 (UTC)
Ahh.. My bad. --Fallensn0w (talk) 18:59, 11 March 2013 (UTC)

customizable Langton's Ants?

It'd be a trivial extension to the language, to allow it to check what color pixel it's currently on. And make it Turing-complete, since you could easily implement the Turing-complete Langton's Ant in it. --(this comment by at 03:26, 10 December 2012‎ UTC; please sign your comments with ~~~~)