Submission #8765: nymx's C64 Root Race "maximum score" in 09:14.47

In this creatively designed strategy game, each player controls a group of trees, manipulating the root system in an effort to reach water. The player with the most efficient root system wins.

The article for this game can be found on page 44 of Compute's Gazette Issue 54 (December 1987)

The continuation of TASing games from my all-time favorite magazine, Compute's Gazette. This makes my 47th TAS from this series.

Previous Compute's Gazette submissions include (In order of submission):

There is no difficulty in this, except for how many trees you want to compete with. In this run, I choose the maximum number of nine. Since this game cannot be TASed any faster, I choose to get the "maximum" length of my root system. Unless you want to loose the idea of getting a maximum score, then a faster version can be created, but I think it makes more sense to play it for the highest available root system possible.

I played this game a ton, in my youth. So I basically have experienced its weakness in AI. For some odd reason, the AI wants to make its move to the outside of the system. I think it does this because its trying to choke off my tree growth, but it really its kinda dumb. Aside from that, RNG doesn't exist...so I had to test what the computer would do against my move. After seeing it's response, I would go back and adjust for my move. This was not always the case, since it does alter its move from time to time. At the beginning of the second round, the computer was struggling...as you will see that it starts to loose the ability to move. This is a very good situation to have, since it means we are winning. One thing to note, it is not possible to completely cut off the computer, since there will always be a single root traveling down for both players. Because my strategy was so strong, it means that the computer will always have the first move of each round.

I couldn't find one.

feos: Claiming for judging.

feos: Accepting.

fsvgm777: Processing.