{"id":392,"date":"2007-04-20T08:00:00","date_gmt":"2007-04-20T08:00:00","guid":{"rendered":"http:\/\/scientopia.org\/blogs\/goodmath\/2007\/04\/20\/flip-out-with-a-pathological-programming-language\/"},"modified":"2007-04-20T08:00:00","modified_gmt":"2007-04-20T08:00:00","slug":"flip-out-with-a-pathological-programming-language","status":"publish","type":"post","link":"http:\/\/www.goodmath.org\/blog\/2007\/04\/20\/flip-out-with-a-pathological-programming-language\/","title":{"rendered":""Flip" Out with a Pathological Programming Language"},"content":{"rendered":"

As promised, this week, I’ve got a new friday pathological programming language. This one is another 2-dimensional language, but it’s pretty different from any of the 2d languages I’m written about before. It’s called “Flip<\/a>“, and the warped minds behind describe it as being sort of like “Programmers Billiards”. It’s a seriously neat language, but it is pretty large and complicated. So I’m not going to describe everything about it in detail: you’ll have to read the language manual<\/a> for that. But I’ll describe enough to give you the flavor of it, and show you a couple of examples to whet your appetite.<\/p>\n

<\/p>\n

As usual for 2D programming languages, the program consists of a 2-dimensional playfield<\/em>, where the program is described by the layout of characters on the field. In Flip, the playfield contains two kinds of things: stationary objects (that is, objects that don’t move on their own), and balls<\/em>, which are objects that go bouncing around the playfield. Balls carry number-values, and the value inside a ball can have an effect on how interacts when it hits other things.<\/p>\n

The simplest stationary objects are walls<\/em>. Horizontal walls are written as “-” signs, and vertical walls are written as “|” (pipe) characters. Horizontal and vertical walls are called mirrors<\/em>. “\/” and “” are diagonal walls – also called flippers<\/em>, for reasons that you’ll see later. Balls bounce off of mirrors by reversing direction; they bounce off of flippers by making 90 degree turns.<\/p>\n

A more interesting stationary object is the sluice<\/em>. A sluice is an object
\nthat only lets things pass through it in one direction. “^”, “>”, “v”, and “<” are the four sluices – they each let balls go through them if they’re moving in the direction
\nthat the sluice points. If balls hits a sluice coming from<\/em> the direction that it’s pointing, then it reverses direction; if it hits it from the side, it bounces and starts moving in the direction that the sluice is pointing.<\/p>\n

Here’s where it starts to get interesting. If there’s a digit in the program, and a ball hits it, the ball will bounce back as if it hit a mirror, and a new ball will be created carrying the digit as its value. So, for example, here’s a little program. The “=” signs are just there to help mark columns – only the “2” is really part of the program:<\/p>\n

\n2\n============\n<\/pre>\n
 A initial ball enters the program at the top left moving right. It moves until it hits to 2, then it will bounce back, moving left until it exits off the right edge; and a new ball carrying 2 will start moving to the right.<\/p>\n
 Here’s another. Again, the “=”s don’t really do anything except set the width of the playfield:<\/p>\n
\n2    4\n==============\n<\/pre>\n
 A ball will enter from the left, hit the 2, and bounce back and move off the field. When it hits the 2, a new ball carrying 2 will start moving to the right. It will get to the 4, hit it, and bounce back, moving to the left, and a 4-ball will be created moving to the right. The 2-ball will move left at the same time the 4-ball moves right; the four will end up falling off the right edge at the same time that the 2-ball hits the 2. Then a new
\n2-ball will be created, moving left, and the old 2-ball will bounce and start moving right. And so on – the 2-ball will keep bouncing back and force, creating 2s and 4s.<\/p>\n
 To do computation, there are things called tarpits<\/em>. “+” and “*” are the two tarpits: “+” for addition, and “*” for multiplication. The first ball that hits a tarpit gets stuck. The second one that hits it gets added or multiplied by the stuck ball, and keeps going the same direction, and the tarpit is then empty again, so the next ball that hits it gets stuck. So, for example:<\/p>\n
\n> 2 + *\n===========\n<\/pre>\n
 First, an initial ball comes in, goes through the sluice, and hits the 2, creating a 2-ball. The 2-ball goes to the “+” and gets stuck. The initial ball bounces off the sluice, back to the 2, which creates another two, which hits the +, and then gets turned into a four, because the 2 stuck in the “+” tarpit gets added to it. The initial ball keeps bouncing, creating 2-balls, which get to the “+”, so every other bounce of the initial ball, you’ll get a 4-ball coming out of the tarpit. It gets stuck in the “*”; every other time a “4” gets created and hits the “*” tarpit, it turns into a 16. So that produces a series of 16s falling off the right-hand edge.<\/p>\n
 For input and output: if a ball hits a “p”, it outputs its value as a number; if it hits a “P”, it outputs its value as a character. So:<\/p>\n
\n>  2  +  *  p\n=================\n<\/pre>\n
 is a program which repeatedly prints out the number sixteen.<\/p>\n
 “X” is where it really starts getting interesting. “X” is called a processor<\/em>. By default, when a ball hits a processor, the processor eats the ball, and creates two copies of it, sending them off at right-angles to the direction from which the processor was hit.<\/p>\n
 But that’s just the default. Most of the stationary objects in Flip can have modifiers<\/em>, and processors get the best set of modifiers.<\/p>\n
 Let’s look at the simplest modifier: “@”, which means “always”. We can attach an “@” to a flipper, by putting it on one of the flippers corners. Then when the flipper gets hit by a ball, it will bounce the ball as normal, and<\/em> it will rotate 90 degrees. “+” means “positive”, so if the modifier of a flipper is “+”, then it will only rotate if the ball that hits it has a positive value. There are a lot of modifiers: check the manual for the list.<\/p>\n
 Some examples of programs, to get you interested enough to go look. Here’s “hello world” – download the interpreter, and prepare to be mesmerized watching it run to see how this prints hello world:<\/p>\n
\n   Dette program skriver \"Hello World!n\" ud.\n1  \/2   \/2   \/2   \/2   \/2   \/2   \/0 \n@     @     @     @     @     @     @\n^  * ^  * ^  * ^  * ^  * ^  * ^  >*\n  X    X    X    X    X    X    X\nv                       +                 + 0\/\n\/\/    \/\/    \/\/    \/X \/  \/\/    \/\/    \/X \/ @\nv+           +                 +     +      0\/\n X    \\   X    \\    \\   X   X   @\nv                 +     +           +     + 0\/\n\/\/    \/\/    \/X \/  \/X \/  \/\/    \/X \/  \/X \/ @\nv            +     +           +     +      0\/\n\\    \\   X   X    \\   X   X   @\nv     +     +     +     +           +     + 0\/\n\/X \/  \/X \/  \/X \/  \/X \/  \/\/    \/X \/  \/X \/ @\nv                              +            0\/\n\\    \\    \\    \\    \\   X    \\   @\nv     +     +     +           +           + 0\/\n\/X \/  \/X \/  \/X \/  \/\/    \/X \/  \/\/    \/X \/ @\nv+     +     +     +           +     +      0\/\n X   X   X   X    \\   X   X   @\nv           +                 +     +     + 0\/\n\/\/    \/X \/  \/\/    \/\/    \/X \/  \/X \/  \/X \/ @\nv            +     +           +     +      0\/\n\\    \\   X   X    \\   X   X   @\nv                 +                 +     + 0\/\n\/\/    \/\/    \/X \/  \/\/    \/\/    \/X \/  \/X \/ @\nv+                             +            0\/\n X    \\    \\    \\    \\   X    \\   @\nv           +           +                   0\/\nP  \/\/    \/X \/  \/\/    \/X \/  \/\/    \/\/    \/\/   @\nQ                                           0\/\n>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n(C) Copyright 2001 Rune Zedeler & Erik S\u00f8e S\u00f8rensen\n<\/pre>\n
 One more example, which is absolutely brilliant<\/em> in its simple
\nelegance: the Fibonacci series generator:<\/p>\n
\n   \/  p\nv   >   X\n1@\n   > X\n + \/\nQ-\n==============\nFibonacci.\n<\/pre>\n
 Now, go download it, and play. You know you want to!<\/p>\n","protected":false},"excerpt":{"rendered":"
As promised, this week, I’ve got a new friday pathological programming language. This one is another 2-dimensional language, but it’s pretty different from any of the 2d languages I’m written about before. It’s called “Flip“, and the warped minds behind describe it as being sort of like “Programmers Billiards”. It’s a seriously neat language, but […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[92],"tags":[],"class_list":["post-392","post","type-post","status-publish","format-standard","hentry","category-pathological-programming"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p4lzZS-6k","jetpack_sharing_enabled":true,"jetpack_likes_enabled":true,"_links":{"self":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/392","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/comments?post=392"}],"version-history":[{"count":0,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/392\/revisions"}],"wp:attachment":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/media?parent=392"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/categories?post=392"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/tags?post=392"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}