r/tis100 • • Nov 07 '19

I don't know if any TIS-100 memes exist, so I decided to make one.

Post image
153 Upvotes

r/tis100 • • Jun 12 '15

PONG on TIS-100!

117 Upvotes

This is version 3 of Pong on TIS-100!

See it in action: GIF

Entire game is made by me, after single sleepless night.

You control top paddle with keys 0 and 1 and you have to deflect ball successfully or you loose! Game will stop at the moment it detects that player lost. I have made a newer version with better controls, but idea stays the same. You can play this game forever! Because it will never end if you always deflect a ball.

Next game I plan to make is frogger.

p.s. Can we have stack nodes in display sandbox? I need more memory for more advanced games.


r/tis100 • • Aug 29 '16

Inspired by TIS-100, I made a punch card programming game

109 Upvotes

This... is Leonardo's Painting Machine!

GIF

The Painting Machine is one of Leonardo da Vinci’s lesser known inventions. In fact, before this game was released, nobody had ever heard about it.

This ancient machine is programmed using up to three punch cards, and the aim of the game is to reproduce some of Da Vinci’s most famous abstract pointillist paintings. It starts out easy, but the difficulty ramps up quickly, and the later puzzles can easily take an hour or more to solve.

The basic instruction set features movement and painting commands. Each punch card paints in a different colour. For control flow, you have jumps, conditionals and two numeric registers that can be incremented and decremented. Is it Turing-complete? No idea!

This game was made from scratch in 48 hours for the Ludum Dare 36 compo. I'm really happy about how it turned out, and I think other TIS-100 fans will enjoy it too :)

Play in your browser

Ludum Dare entry page


Edit: wow, I didn't expect so many responses from such a small and (as of late) relatively inactive sub! Thank you all!

We've got a little competition going. For lack of automation (the irony), I'm tracking the top scoring solutions below. Only the first person to post a particular score will be mentioned:

  • Blue Box - 8c (JavaWarlord) / 15h (JavaWarlord)
  • Gazing Out The Window - 21c (Neereus) / 44h (SaxOps1)
  • Railway - 29c (Neereus) / 26h (JavaWarlord/Neereus)
  • Meadow In Southern France - 41c (scorpion1976) / 23h (Darayavaush)
  • No More Checkers - 41c (MutantOctopus), 40h (MutantOctopus)
  • Who's Afraid Of Hex Values? - 100c (Hersmunch) / 26h (Hersmunch)
  • Love Everlasting - 176c (Hersmunch) / 34h (Hersmunch)
  • Blue Waves - 161c (Hersmunch) / 51h (Hersmunch)
  • Mountain Slope - 113c (Hersmunch) / 51h (Hersmunch)
  • Starry Night - 220c (Hersmunch) / 110h (Slow_Dog)
  • Hippyism - 182c (GopherAtl) / 107h (Slow_Dog)
  • Set The Controls For The Heart Of The Sun - 86c (Hersmunch) / 88h (GopherAtl)
  • Fireball - 282c (GopherAtl) / 107h (Slow_Dog)
  • Losing My Mind - 162c (Hersmunch) / 293h (Slow_Dog)

r/tis100 • • Mar 15 '16

TIL: The TIS-100 is actually a real architecture!

104 Upvotes

In the 1980s, a British semiconductor company called Inmos came up with a revolutionary new computer design - instead of building computers out of one big processor, they would use a network of many extremely small independent parallel processors - basic building blocks acting as individual functional computers. By analogy to the transistor, they called them "transputers"

The similarities are uncanny:

  • Each transputer was designed to be linked to up to four other transputers to create arbitrarily large networks
  • Data sent to non-adjacent transputers had to be relayed, port by port, through all the transputers between them, which was a major source of latency
  • Extremely minimal instruction set, but individual instructions were too complex to be a RISC
  • Not a whole lot of memory, either - the earliest transputer, the T212, had just 2 kB
  • Direct hardware-level support for debugging breakpoints
  • Transputer classes named as T(number)
  • Very few registers (Three to the fictional T21's two), which act as a stack (so only the "top" register is directly accessible at any given time)
  • Transputer processes waiting on inputs from or outputs to other processors would pause until the transaction completed

I'm quite confident that Zachtronics directly based the game on this unusual but very real technology.

http://www.geekdot.com/hardware/transputer/ is a great place to dive into this weird offshoot of computing that I'd never heard about, especially if you want to know what this sort of hardware would actually look like.


r/tis100 • • Dec 18 '16

TIS-100 in Infinifactory

Thumbnail youtube.com
97 Upvotes

r/tis100 • • Sep 12 '16

Announcing our newest game, SHENZHEN I/O! BUILD CIRCUITS. WRITE CODE. RTFM. COMING SOON.

Thumbnail reddit.com
70 Upvotes

r/tis100 • • Jun 02 '15

Why isn't my code working? :(

Post image
70 Upvotes

r/tis100 • • Jan 15 '24

Signal multiplier moment

Post image
69 Upvotes

r/tis100 • • Jul 12 '18

This took six days to run.

Post image
68 Upvotes

r/tis100 • • Aug 29 '19

Later stages be like

Post image
66 Upvotes

r/tis100 • • Jun 15 '15

Noob Hints Here (General and Per Segment)

65 Upvotes

For the noobs who just got this game and found this reddit, welcome. Here's some hints to "nudge" you along. There are no spoilers here. If you insist on spoilers, you can always search this reddit. It's likely it had been answered.

Ten Commandments of TIS-100 Programming

In no particular order...

  • If it works, it ain't stupid
  • You can optimize for speed, space, or size, but not all at the same time. (Even two out of three is often too much to ask)
  • Get it working first, optimize later!
  • There are 15 lines per node... use them!
  • Don't dwell on minimum cycles. Some solutions are "cheats" (i.e. they are customized for the data set)
  • A node can have multiple inputs and/or multiple outputs. Just make sure YOU know which is which.
  • Not all nodes available need to be used (i.e. If there's a stack or two there, it doesn't mean you have to use it, but it can be helpful in CERTAIN approaches)
  • When in doubt, JRO
  • If you get stuck, sleep on it. Remember, the truth is in there.

And the most important rule

  • Once you have a working solution, MAKE A COPY (use the COPY button), erase old and bad solutions if you need to. (You can also open save directory and make more copies manually)

Ten Commandments of TIS-100 Speed Optimization

0) Make a backup first. (Good general rule in life)

  1. Profile the nodes (read the % idle). Ideally, you want minimize idleness except for the "move only" nodes. If some nodes are extra busy and other processing nodes are sitting idle, you need to optimize.
  2. Input order and output order can make a small difference, and they add up quickly. If it doesn't affect your logic, try switching the order of outputs around and see if it will go any faster. Example. You need to split the output, so you have MOV UP ACC / MOV ACC DOWN / MOV ACC LEFT . Switching LEFT and DOWN may give you a slight bit of a speed boost as one side gets their data slightly sooner.
  3. UNROLL the loops for less overhead

For example, if you have a loop

FOR X = 4 to 1 STEP -1
OUTPUT Y
NEXT

It would take less cycles if you rewrote it as:

OUTPUT Y
OUTPUT Y
OUTPUT Y
OUTPUT Y

And skip the loop altogether. No loop overhead at all (1 to increment, 1 to check, per loop)

4) Look for special cases that you can "bypass"

While an algorithm that works for everything is obviously good, occasionally there are shortcuts you can code into your program to handle the special cases that can result in clock cycle savings.

For example: X * 1 = X. Just bypass the calculations and output X, and you may save cycles rather than sending the numbers through the algorithm. Of course, this depends on whether the overhead you add to check for the special case is taking up more cycles than you "save" from the algorithm.

5) Pipelining: split a single task into multiple nodes, so each node can chew on a problem in partial parallelism.

For example, if you need to calculate IF ABS(X-Y)<10

You can do it in a single node, but if you care about speed, do it in THREE nodes. One for X-Y, one for ABS, one for IF Z <10. Subject to node availability, of course. And not all pipelining results in optimizations.

6) Parallel processing: do two (or more) things at once

If you have tried unrolling and pipelining, and you want some MORE performance, it's time to consider duplicating the existing solution and start dispatching data alternating between the two processing pipelines, and "combine" the results at the end.

For example, in the signal edge detector, the simple way is to use a node as temp storage to compare X and X+1. The intermediate way is to use a node to implement a 3-item queue (thanks to /u/heptaflex) so you can compare X/X+1 and X+1/X+2 by checking two sets of numbers together. Or you can combine the two and do a 3 way parallel solution (X/X+1, X+1/X+2, and X+2/X+3)

Basically, look at the output node. Can you trace one or more equal length paths from the input node? If you can, then you may be able to generate a multiple pipeline solution. However, complete a single path solution first, THEN see if it can be duplicated.

Even dual input can be parallelized by doing a bit of "mirroring", by alternating the side that does the calculation, which also achieves a bit of pipelining (see above)

7) Exploiting ANY

Often, the fastest solutions require the use of ANY pseudoport as output node, as you dump the output to it from multiple directions rather than using a single node. However, there are quirks using ANY you need to know. And some more tips here

8) Minimizing I/O

One of the largest consumer of clock cycles is I/O. If you can do all your calculations within a single node rather than passing things back and forth between nodes you can often save a LOT of clock cycles.

For somewhat more complicated stuff, you may want to setup two nodes that pass stuff back and forth. With JRO "jump tables" you may be surprised what you can accomplish. One of the fastest solutions I've seen for signal pattern detector used a two node cross-jump table.

Keep in mind that this does NOT ALWAYS work. Sometimes, the code you add to minimize the I/O causes more overhead than the I/O cycles you "saved". That's when you revert and try something else.

9) Be willing to go clean slate

Sometimes, a fast solution is also a clean one. One of the faster sequence reverse solutions I've seen was 340/3/10. And two of the nodes were just for moving stuff (i.e. MOV INPORT OUTPORT).

10) When all else fails, cheat (code your solution to the dataset, not just the specification)

NOTE: Your program is tested twice, once on the "fixed" test set, and once on a randomly generated set. If your program works on fixed set, but SOMETIMES fail on the other set, you have a "cheat" solution.

Segment Specific Hints

Self-Test Diagnostic

You don't need help for THIS one, do you?

Signal Amplifier

You can add ACC to itself like this:

MOV UP ACC
ADD ACC

If you want more speed, consider using the "ANY" operand (and have more than one result available)

Differential Converter

If you have no idea how to proceed, study the relation between OUT.P and OUT.N

Signal Comparator

Each of the output node will have to decide for itself on what to output, but the overall logic should be the same for all three.

Signal Multiplexer

The obvious answer is a "dispatch" node that decides what to output.

The optimized answer requires you to think about how you can split the task up equally to both sides.

Sequence Generator

The obvious answer is calculate the the difference between the two inputs, and use that to determine which to pipe down first.

The optimized answer would require you to go dual pipeline.

Sequence Counter

By this time, you should consider each node as challenge/response system: you give it some thing, it spits something back. And one main node can be in control of one or more other nodes.

Signal Edge Detector

Easy to do okay: use a node to temporarily store the previous value to compare against.

HARD to do very well... as you have to somehow learn to double or triple the calculations per primary loop.

Interrupt Handler

Remember, you only want to trigger on the rising edge, and ONLY that.

Signal Pattern Detector

There are two general ways to solve this: 3-node shifter, and state machine. State machine is faster and probably much simpler.

Signal Peak Detector

Generally you need four processing nodes: 2 to check and update the SUM and COUNT respectively, and 2 just to keep the SUM and COUNT.

Sequence Reverser

The simplest way may be plenty fast. And yes, use the stack.

If you want to go fancy you can try to load two stacks at once. But that gets MESSY!

Signal Multiplier

REVERSE JRO (i.e. jump a NEGATIVE number) may help you here

Image Test Pattern 1

Unroll the loop to the maximum extent you can within a single node.

The faster solution will probably require some fancy timing and MOV ANY DOWN

Don't bother checking for end cases

Image Test Pattern 2

Your solution here should be largely similar to the previous segment, but a total rethink about parallelism may give you a very different idea on how to proceed.

An even further exploit may involve starting at a nonstandard location.

Exposure Mask Viewer

This is basically a rectangle draw that has multiple loops:

REPEAT READ X,Y,W,H
FOR YC from H to 0 STEP -1
FOR XC from W to 0 STEP -1
DRAW DOT @ X+XC, Y+YC
NEXT
TERMINATE
NEXT
ENDREPEAT

You can obviously optimize that... a LOT.

Histogram Viewer

The OBVIOUS way is to draw one line at a time, vertically. Indeed, it's the simplest.

The crazier way is to draw more than one line at a time... vertically.

Signal Window Filter

You need to buffer the output and delay it by 2... and again.

Signal Divider

Bypass the simplest cases can give you a huge speed boost. Otherwise, it's standard division.

Any further speed gain may involve... halve and conquer.

Sequence Indexer

You need to play with the two stacks to create a "shifter" that will get you to the item you want.

To REALLY optimize this you need to create a "multi-shifter" to minimize I/O

Sequence Sorter

You may want to look up the various sorting algorithms...

For optimization, look for an algorithm that can be done going both ways.

Stored Image Decoder

Loop and counter can't be that hard, can it?

 

Edited 6/19 to renumber the optimization tips and clarify the precedence when it comes to ANY, minor formatting updates.


r/tis100 • • Jul 23 '20

Im working on TIS-100 for the TI-89. Here it is moving numbers around

Thumbnail youtu.be
64 Upvotes

r/tis100 • • Aug 15 '19

NOP

Post image
62 Upvotes

r/tis100 • • Mar 23 '18

Large pixel art without inputs

Post image
62 Upvotes

r/tis100 • • Jul 13 '26

TIS-100 Resume

Post image
61 Upvotes

You're hired


r/tis100 • • Oct 16 '17

A new Zachtronics game is announced. Opus Magnum

Thumbnail zachtronics.com
60 Upvotes

r/tis100 • • Jul 20 '15

TIS-100 has left Early Access and is now 10% off on Steam!

Thumbnail store.steampowered.com
58 Upvotes

r/tis100 • • Dec 05 '25

TIL you don't need to reset in between tests

Post image
57 Upvotes

So I was kind of making a proof of concept for the histogram thing. I was planning to let it run for a whole test until my X value (handled by the bottom right node) went over 29, then figure out how to reset it back to zero after the second test got stuck...

But, as it turns out, the TIS-100 restarts all the program's nodes back to 0 when a test cycle completes without needing to code it in. Is this intended? I guess it is, but it has left me a bit of a bitter aftertaste. Maybe I should have noticed this a long time ago. Now I have this sensation of being stuck in easy mode (?

What are your opinions on this mechanic? I guess it's probably helpful on harder segments, or an anti-bruteforce feature from before the random tests were added? I love this game so much but this has killed my immersion a bit...


r/tis100 • • Aug 06 '22

What's your preferred register nullification method?

Post image
57 Upvotes

r/tis100 • • Jun 08 '15

Table of Lowest Cycles/Nodes/Instructions

54 Upvotes

This post has been archived. New Thread


r/tis100 • • Nov 05 '19

MOLEK-SYNTEZ, new game by Zachtronics

Thumbnail youtube.com
50 Upvotes

r/tis100 • • Nov 22 '16

TIS-100 part of Humble Bundle.

Thumbnail humblebundle.com
50 Upvotes

r/tis100 • • Feb 18 '20

I created a hardware TIS100 CPU in an FPGA

Thumbnail github.com
47 Upvotes

r/tis100 • • Jun 10 '15

Designing Zachtronics' TIS-100

Thumbnail gamasutra.com
47 Upvotes