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.

⚶

From Esolang
Jump to navigation Jump to search

⚶ (pronounced Vesta) is a tree-based esolang made by User:Ϫ.

Before a ⚶ program has been run, the tree has one node, 0:0. The pointer starts at 0:0. Any point on the tree is defined as [generation]:[ordinal]. For example, say that there is a tree defined as such:

       @
     /   \
   @       $
  / \     / \
 @   %   @   @

If the pointer is at the point at the far bottom-midleft [the %], then the pointer's location is the 2nd generation and the 1st ordinal. If it's at the middle-right [the $] then it is in the 1st generation and the 1st ordinal. The pointer has a memory cell that can contain one number.

Commands

ᔀ Go down the tree, favoring going left if possible.
ᓽ Like ᔀ, except for going right.
ᕍ Create a node to this node's down-left. If there is already a node there, push it further down after creation.
ᕊ Create a node to this node's down-right. If there is already a node there, push it further down after creation.
ᑍ Go up the tree.
ᐰ Go up the tree, destroying the current node and anything after it. If this destroys 0:0, instantly halt the program.
ᖃ Subtract the current ordinal from the memory cell's value.
ᖁ Add the current ordinal to the memory cell's value.
ᖒ Output the memory cell's value as a number.
ᖔ Get input and put it into the memory cell.
ᔔ If the memory cell is 1, do ᕊ. If it is 0, do ᕍ. If it is anything else, do ᐰ.
ᔖ If the memory cell is 1, do ᓽ. If it is 0, do ᔀ. If it is anything else, do ᑍ.
⚶ If the current generation is even, jump to the current ordinalth command in the program.

Programs

Truth Machine VERY WIP

ᖔᕊᔖᖒ⚶