BrainDen.com - Brain Teasers
• 0

## Question

VNA 3.0 ~ Evolution

VNA 3.0 is a game of battle and survival, mutation and destruction. In the game, you write a program [don't lose me yet, it's a very simple language, even much simpler than previous VNAs] and then the program takes it from there, hoping to win out over enemy programs and conquer the Virtual Node Array.

Digital virii vying for computer memory may not sound like your slice of cake, but it's actually an exciting and engaging game

This is the most radical change on previous VNA games - so I wouldn't advise going and looking through those topics for advice, programs, etc - you'll be able to find all that here and more

Let's face it: while I tried to pepper up VNA 2.0 to make it more accessible to non-programmers, it really only catered to those with a knack for coding. VNA 3 is different in that it's much easier to grasp - anyone can be awesome at this game

So, what does VNA even stand for? It's an acronym for "Virtual Node Array", a cyber-arena of 300 "nodes". This epic warzone is where the battles take place. Where the digital evolution takes place.

So what is a node? Well a node is like a little memory niche within the VNA, a distinct line of code. Nodes are numbered 0 to 299 but this is irrelevant - the VNA wraps around like a Mario game, so if you go over the top, you come out on the bottom, and vice versa. Thus, if you were on node 290 and go forward 20 nodes to 310, this is actually the same node as node 10. ie, 300=0, 301=1, 302=2, 405=105, 599 = 299, 600=0 again, etc. Likewise, -1 = 299, -2 = 298, etc.

Because of this, your program never knows its "absolute address" within the VNA... everything is relative. When dealing with a line number, 0 means the current node. 1 is the node one line down from your current position, etc. Say your current position is at node x:

* this is node -2

* this is node -1

* this is node 0, ie, the current line

* this is node 1

* this is node 2

This is probably the most complicated concept of VNA 3.0, so if you're good with this, you're ready

Moving on, to the concept of pointers. Each person has nine pointers, indexed with a digit from 1 to 9. At the beginning of the game, only pointer 1 is activated, the rest are in "stasis" mode. A pointer carries two statistics: Node and Energy.

Node signifies what node the pointer is currently on. Thus when the pointer runs, it runs that node and executes a command telling the program what to do. After most nodes, the pointer's Node value increments by 1, so that it runs the next node on the next round.

Energy signifies the digital life force of the pointer. The original pointer (#1) starts out with 10 energy. When a pointer runs a node, its energy is decremented by 1 unless the node's command is FOOD, which adds 1 to energy. If a pointer reaches 0 energy, it dies and returns to "stasis".

So, in the beginning, your program is placed randomly into the VNA. Your pointer #1 is given 10 energy and its Node is equivalent to the starting node of your program.

The two warring programs start at an undeterminable distance apart. All other nodes are inhabited by JUMP 0,1 ... essentially a "blank" node that just increases the pointer's Node value by 1.

Then the game begins!!!

The game progresses in rounds. Each round, your pointers are run through. Pointer #1 goes first, then #2, etc, all the way up to #9. If a pointer is in stasis, it is skipped. Then it's your opponent's turn. A round consists of a full turn by both players.

So, what do nodes consist of?

A single node is made up of a "command" and then a space and then two "parameters", separated by a comma. Parameters are just input for the command.

Here are the commands:

```Commands:

------------------------------------------

name		   effect on pointer's energy

-------------------------------------------

COPY a,b			-1 energy

JUMP a,b			-1 energy

EDIT a,b,c		  -1 energy

FOOD a,b			+3 energy```
An advanced feature that may assist you is a concept known as a variable - a symbol used to store data. In VNA 3.0, there are three basic variables: ! # \$ you can use them in commands instead of a number. Ie: COPY !,6 or even two variables: COPY !,\$ or two of the same variable: COPY #,# '!' and '#' are independent to your program, so you and your opponent can have different '!' and '#' values. However, '\$' is a shared variable, and you and your opponent(s) have access to the same '\$' You can set the variables with the following three commands:
```SET!	  a,b

SET#	  a,b

SET\$	  a,b```
All three have the effect on energy of ±0 .. ie, they have no effect and do not reduce nor add to energy. Also, after running a SET command, the Node of the pointer goes to the next line as usual. So how do they work? Well, the 'a' parameter is the new value of the variable, and the 'b' parameter is usually ignored. Ie: SET! 7,0 this sets the '!' variable to 7 The only time 'b' is taken into account is if b equals a special number: if b = -1, the variable is set to the a-parameter of line +a if b = -2, the variable is set to the b-parameter of line +a if b = -3, the new variable is INCREASED by the a-parameter of line +a if b = -4, the new variable is INCREASED by the b-parameter of line +a I know that doesn't make sense, so I'll give a few examples:
```SET#   19,0		  // sets # to 19

SET#   7,-1		  // sets # to the a-parameter of line +7

SET#   7,-2		  // sets # to the b-parameter of line +7

SET#   8,-3		  // increases # by the a-parameter of line +8

SET#   8,-4		  // increases # by the b-parameter of line +8```
Unless the b-parameter is -1, -2, -3, or -4, it is ignored. ~~~ There are a couple more types of variables. The first type is the letter p followed by a number from 1 to 9.... p1 = represents the line of pointer #1 relative to your current line p2 = ditto for pointer #2 p3 = ditto for pointer #3 p4 = ... etc, all the way down to p9 ie: JUMP 0,p6 This line would jump the current pointer to the current location of p6 [as the line value of p6 is given relative to the line of the current pointer] If the pointer in question doesn't exist (is in stasis), the variable's value is 300. If the 300 isn't checked and is used as 300, remember that saying node 300 (or 600, or 900, or -300, etc) is the same thing as saying node 0. However, this can be distinguished from 0 because, if the pointer DID exist and was at the same line, it would show as 0, not as 300. So if a pX variable is 300, you know that it's in stasis 'pX' variables always return a number in the range 0 to 299 (except for 300 if the pointer is in stasis), so even if you use p7 and pointer #7 is at the node -1 from you, the p7 variable will be 299 instead of -1 Also: you can do the following: p!, p#, p\$, pe and pt. This is just the pX variable with another variable representing the pointer number [see the next sections for what 't' and 'e' are]. However if the variable isn't a number 0 to 9, the value 600 is returned [this equates to 0 if used as a line number of course]. This is true even if a variable is not being used. Ie, p2.8 will return 600, as will p10. so: pX = 300 if pointer X is in stasis pX = 600 if X is not an integer 0 to 9 both numbers equate to node +0 if used as line numbers. ~~~ The next variable is 'q' ... 'q' is the current pointer's pointer-number, ie, a number from 1 to 9. If you need to use it, it's there ;P You could do 'pq', but that will always return 0 of course ~~~ The next is 't' - t is an integer 1 through 9 that represents the total number of living pointers at this current moment in your program ~~~ The final variable is 'e'. The pointer dealing with 'e' sees 'e' as the pointer's current energy ie, if the pointer has 5 energy and reads this line: JUMP 0,e It will see it as (for the moment) = JUMP 0,5 ~~~ What happens if variable parameters are edited, added to, etc? COPY 2,7 EDIT -1,\$,a+: This will add \$ to the a-parameter of the COPY line. The variable '\$' is examined and the value for that point in time is used for the addition. If '\$' is changed later on, it doesn't magically change the COPY too, the COPY is a set value Likewise: COPY \$,7 EDIT -1,3,a+: This will add 3 to the COPY's current a-parameter, which is whatever the variable '\$' is currently is, and then make that the new a-parameter. This value becomes set, ie, the '\$' part is overwritten with whatever the '\$' is at that moment, plus 3 from the EDIT ~~ Also, when dealing with the 'p1' to 'p9' variables and the 'e' variable, the value changes depending on which pointer of which program is viewing the line of code. Keep that in mind.
For extra power in your program, you can use a comparison operator in a parameter. This is denoted with the lowercase letter 'c', followed by underscores separating arguments in the comparison. Like so: c_1_2_3_4_5 There are always 5 arguments, and they must be either numbers or variables (you cannot nest comparisons within comparisons). The comparison as a whole evaluates down to one value, which is taken to be the parameter. It works like so: if 1=2, then the comparison evaluates to 3 if 1>2, then the comparison evaluates to 4 if 1<2, then the comparison evaluates to 5 This is like a variable in that, if the comparison is edited or used for editing, it becomes set in stone as an integer rather than retaining the variability. A quick example: JUMP 0,c_!_3_46_-5_-5 This compares the '!' variable to the number 3. If they are equal, the pointer jumps forward by 46 nodes. Otherwise it jumps backwards 5 Another example: SET\$ c_!_#_!_!_#,0 this takes the larger of the two variables '!' and '#' and sets that to the '\$' variable A final example: JUMP c_p7_300_7_0_0,c_p7_300_1_-3_-3 if p7 is in stasis, this creates it at node +1, but if p7 already exists, the current pointer jumps backward 3 ~~~ You can use comparisons in the c-parameter of EDIT, like so: EDIT 7,8,c_#_1_a+:_x*@_b^- if # = 1, then 'a+:' is used for the c-param if # > 1, then 'x*@' is used if # < 1, then 'b^-' is used
Like comparisons, math units are chunks of code that take in input and evaluate to a single number. Math units always start with a lower case "m" followed by an equals sign ("=") and then two numbers OR variables separated by an operation symbol. Like this: m=5+3 this evaluates to 5+3, or 8 m=e*7 this evaluates to seven times the pointer's current energy m=!+p# this evaluates to the value '!' plus the line distance to pointer '#' Like comparions, Math Units use the current variable value, etc, and if edited or used for editing, the current value is used, and thus editing a math unit by adding 2 to it will overwrite it with a fixed value. So a Math Unit is made up of 'm=' and then two numbers or variables separated by an operator. What are the operators? + = add the numbers - = first number minus the second * = multiply the numbers % = divide the first by the second, take remainder. If the second number is zero, the first number is outputted instead & = smushes the two numbers together (ie, 5 & 7 = 57) > = takes the greater of the two numbers < = takes the lesser of the two numbers Note: Math Unit input values MUST be numbers OR variables. You cannot nest other Math Units or Comparisons within a Math Unit. HOWEVER, you can have Math Units within Comparions!!! Say that pointer #1 runs the following line of code. It would jump pointer #2 ten nodes forward from pointer #1 JUMP 2,10 But what if you wanted to jump #2 ten nodes forward from itself, ie, from #2 instead of from #1? No problemo! JUMP 2,m=p2+10 Simple and effective ;D take this: JUMP c_m=!+1_#_9_0_0,c_\$_5_m=2*e_m=p3+17_m=p3+17 In this convoluted example, it compares the variable '!' plus 1 with the variable '#'. If they are equal, it jumps pointer 9, otherwise it jumps the current pointer. And it jumps this pointer to a different spot depending on '\$'. If \$ is equal to 5, it jumps it forward from the current pointer by double the 'e' variable, otherwise it jumps it 17 nodes forward from pointer #3. This example was just to demonstrate the Math Unit's power and flexibility :~D You cannot use a Math Unit in an EDIT command's c-parameter, as it would have no use there.
If you did peek, and now you're confused, don't worry, I know that some of this is complicated
COPY 0,1 This is a basic "replicator" program. Analyze it - what does it do? It copies itself (node 0) forward 1 node. Then the pointer advances to the next line, which is exactly the same, and runs that. This program will die after 10 rounds when its energy hits 0. Take this program: FOOD 0,0 JUMP 0,-1 This is a basic "guzzler" program. It adds 3 to its energy supply, then jumps itself backwards 1 (-1 to energy supply), then adds 3, etc, in an infinite loop. It continually gains energy, thus it never dies - but doesn't accomplish much else. Guzzlers can be useful sub-programs but would almost never be alone as a full program in themselves. This: COPY 4,10 EDIT -1,2,b+: FOOD 0,0 JUMP 0,-3 JUMP 0,100 is an example of what I call a "bomber". It drops a "JUMP 0,100" command every other node starting with the node +10 from the COPY. This is in an attempt to (eventually) overwrite an enemy program's lines and send it out 100 into desert of blank nodes (remember, the VNA starts out full of JUMP 0,1 commands before the programs are dropped in) so that its energy is depleted and it dies. You can trace the program line by line to see how it works. Think of the "JUMP 0,100" as a bomb that we're trying to hit the enemy program with. * COPY 4,10 ~ this drops the "bomb" (+4 from the COPY) to a spot +10 from the COPY * EDIT -1,2,b+: ~ this increments the COPY's b-parameter by 2 * FOOD 0,0 ~ this increases energy by 3 * JUMP 0,-3 ~ this jumps back to the beginning of the program Then it happens all over again. Remember that the program copies the "bomb" to a new spot every time because the EDIT command keeps adding 2 to its previous value and it sends the bomb out 2 nodes further each iteration. Perhaps a better choice for a one-line bomb would've been JUMP 0,0 ... this will cause a pointer to keep jumping to itself over and over again until its energy is lost and it dies. However this is probably in the vicinity of its other pointers and is thus more susceptible to being re-overwritten and saved. It's a tradeoff ;D Notice how the FOOD node is placed so that the program stays in an energy equilibrium.
~~~ NUMERICAL SPECIFICATIONS * max program size: 50 nodes * starting distance between programs: random. If P1 is assumed to start at "node 0", then P2 can start anywhere from "node 56" to "node 244" ~~~ Because of the way that VNA 3.0 is set up, much more creativity is endowed upon the coder. There are no simple bomb-commands or other instructions that delete a pointer or send it into stasis - the only way to do this is to deplete its energy to 0. There are numerous ways to do this (such as JUMP 0,100 in the example bomber, or better yet JUMP 0,0) with different advantages to them, and you can create more complex multi-command traps, etc, that suit your program better. General structure is of course different than previous VNAs with the lack of functions in this game, but this solves a lot of problems and makes for a better well-rounded game I think. There's no ubernesting, no megastructures, no paradoxical parameter references. Everything is airtight and simple. I also gave enough functionality for complex programs to be built without functions, so the variety of digital organisms should be pretty explosive
• Why Energy? I introduced energy to throw a monkey wrench into the works Programs are less like perfect machines and more like cyberzoa, more like battling virtual creatures, which is more how the game is designed. With the introduction of energy & pointers and the way they fit together, your programs can become both more simple and more complex at the same time, in different ways. With this new element, programs have to fit their environment, not the other way around. • Self-Sustaining? Gone is the day where a program can copy itself around the VNA forever, until the array is a soup of code fragments. In VNA 3.0, many programs have life spans - but this doesn't mean that guzzlers (a self-sustained program that just hides in a couple lines of code) will win... a good program, if it has a life span, has a long one, long enough to bomb to pieces a guzzler before it dies. But the type of program most affected by VNA 3.0 and the introduction of energy is the Hopper. I'm currently under the impression that it's impossible to create a self-sustaining hopper, but I'd be happy to be proved wrong. I just made one that survived 1342 rounds before dying of natural causes (I was cheap and filled all the extra space before the actual program with FOODs, without those it survived 74 rounds lol)... I'm sure someone else can do better ;D • Addendum: the above paragraph was written before I added some of the current features. Now I was able to make an efficient self-replicating hopper that not only sustains itself energy-wise but continually gains energy.
* Something I forgot to do a couple times while testing was to put the 'm=' in front of a Math Unit * One thing you should keep in mind is that each pointer is ran each round, cycled through one at a time. If stasis, skipped. This means that, if pointer #1 creates pointer #7, pointer #7 will take its own move before the round is over. However, if pointer #7 creates pointer #1, pointer #1 won't run until next round * Test your program! ;D My emulator has a handy option where you can check a checkbox to ignore program 2, and it just focuses on P1
Some useful "bombs": Pit Trap: JUMP 0,0 This is a basic bomb, although with a hidden weakness that it keeps the pointer within the bounds of its program and could potentially be repaired, if the program has some sort of repairer pointer for that purpose. Fling Trap: JUMP 0,100 This is a bit riskier but with more potential payoff. The pointer is flung far away from its nest into no-mans-land, where it can decrement to 0 energy or run into another bomb of some sort (such as a Pit Trap) to ensure the process without chance of rescue. Vortext Trap: JUMP 1,1 EDIT -1,1,a+: JUMP 0,-2 This is named such as it vacuums in the other pointers one by one. I'm still not sure whether it's best to use "JUMP 1,0" or "1,1" as the first line. The Vortext Trap isn't completely efficient as, the more pointers bouncing around within it, the faster the number gets incremented and some pointers may be skipped. Also, it takes at least three times longer to properly plant the trap. If you do use it, drop it in reverse order (ie, the last line first, then move backwards) Landmine: COPY 3,-5 EDIT -1,-2,b*: JUMP 0,-2 JUMP 0,0 This one "explodes" when the enemy pointer hits it, spewing pit trap bombs forward and backwards exponentially until the pointer dies. This one forces the captured pointer to contribute to its own program's demise, which is helpful. However, the innocent "-5" has a tendency of growing very fast. There may be a couple ways to fix this, I'll leave it up to you if you want to use it ;D Like the Vortex Trap, you should drop the Landmine in reverse order Other Tips and Tricks * Test your program and make sure your pointers (if you have multiple pointers) work well together. There's no need to use all 9 unless you want to, sometimes that's better for the program, sometimes it slows it down - it depends on the program. But, as for pointers, keep in mind that each round, your pointers are cycled through 1 to 9 and ran, even if they were created earlier in the round by an earlier pointer * Use clever combinations of systems - with VNA 3.0's features, you can do a lot of stuff, and there's probably a way to do what you want, so keep your mind open for new techniques ;D * One thing that VNA 3.0 has more of is lines... the total size is 300 nodes, the distance is 56 to 244
vna3.html and the max program size is 50. It's not as hard to use all 50 nodes. In general it's a good strategy to try to do as many things with as few nodes (less vulnerability), but with multiple pointers, you might still need quite a few lines
VNA 3.0 Emulator
Works very fast and smooth
Spoiler for source code:
* copy ALL of it * open a new text file (in TextEdit, NotePad, etc) * paste it * save as vna3.html or something similar (the important part is ending with .html) * here it is:
```<html>

<title>VNA 3.0 ~ Evolution</title>

<script LANGUAGE="javascript">

/* define global vars */

var vna = new Array();

var fillcode = "JUMP 0,1";

var exclam_1 = 0;

var exclam_2 = 0;

var pound_1 = 0;

var pound_2 = 0;

var dollar = 0;

var gameover = 0;

function doSwitch()

{

getp1 = document.form1.p1.value;

getp2 = document.form1.p2.value;

document.form1.p1.value = getp2;

document.form1.p2.value = getp1;

}

function doClear()

{

document.form1.p1.value = null;

document.form1.p2.value = null;

}

function doRandomStart()

{

/*

56 57 ... 243 244

0 1 ... 187 188

*/

document.form1.startline.value = Math.floor(189*Math.random())+56;

}

{

var error1="";

var error2="";

if (document.form1.p1.value == "") error1 = "P1 is not specified! ";

var pr1 = new Array();

var pr2 = new Array();

pr1 = document.form1.p1.value.split("\n");

if (document.form1.checky.checked == true && document.form1.p2.value == "")

{document.form1.p2.value = fillcode;}

else if (document.form1.p2.value == "") {error2 = "P2 is not specified! ";}

pr2 = document.form1.p2.value.split("\n");

var nStart = document.form1.startline.value;

var error3="";

var error4="";

var error5="";

if (pr1.length > 50) error3 = "Program 1 is too long! ";

if (pr2.length > 50) error4 = "Program 2 is too long! ";

error4 = error1 + error3 + error2 + error4;

if (nStart=="")

{

var rvvx = Math.floor(189*Math.random())+56;

alert("No starting node for P2 given - generating one randomly: "+rvvx);

document.form1.startline.value = rvvx;

nStart = rvvx;

}

nStart *= 1;

nStart = doMod(nStart);

var iString;

for (i=0;i<300;i++)

{

iString = fillcode;

if (i<pr1.length) {iString = pr1[i];}

if (i>=nStart && i<nStart+pr2.length) {iString = pr2[i - nStart];}

if (iString == undefined) iString = fillcode;

vna[i] = iString;

}

document.form1.vnarray.value = vna.join("\n");

document.form1.pt1_1.value = "0;10";

if (document.form1.checky.checked == false) {document.form1.pt2_1.value = nStart + ";10";}

else {document.form1.pt2_1.value = "stasis";}

// 9 through 26: element index for the 18 pointers

// alternates pt1_x and pt2_x

for (iq=11;iq<27;iq++)

{

document.form1.elements[iq].value = "stasis";

}

document.form1.rnds.value = 0;

document.form1.dornd.disabled = false;

document.form1.doxrnd.disabled = false;

document.form1.xrd.value = 10;

exclam_1 = 0;

exclam_2 = 0;

pound_1 = 0;

pound_2 = 0;

dollar = 0;

gameover = 0;

}

function doRound()

{

// increment round counter

document.form1.rnds.value++;

// P1 runs pointers 1 - 9

// P2 runs pointers 1 - 9

// skip pointer if in stasis

var zeval;

for (ix=9;ix<26;ix=ix+2)

{

zeval = document.form1.elements[ix].value;

if (zeval != "stasis") runPointer(ix,1);

}

if (document.form1.checky.checked == false)

{

for (ix=10;ix<27;ix=ix+2)

{

zeval = document.form1.elements[ix].value;

if (zeval != "stasis") runPointer(ix,2);

}

}

}

function doXRounds()

{

var getx = document.form1.xrd.value;

for (iv=0;iv<getx;iv++)

{

if (gameover == 0) doRound();

}

}

function doMod(zeinput)

{

while (zeinput < 0)

{

zeinput += 300;

}

zeinput = zeinput % 300;

return zeinput;

}

function runPointer(pointx,playernum)

{

var qstring = document.form1.elements[pointx].value;

var pdata = new Array();

pdata = qstring.split(";");

// line number

var qline = pdata[0]*1;

// energy

var qen = pdata[1]*1;

// aaand we begin!

var sline = vna[qline];

// isolate command

var cmdname = sline.substring(0,4);

var params = sline.substring(5);

pdata = params.split(",");

var parama = pdata[0];

var paramb = pdata[1];

var paramc = "";

if (pdata.length > 2) paramc = pdata[2];

// check for comparisons

if (parama.charAt(0) == "c") parama = doComp(parama,pointx,playernum,qen);

if (paramb.charAt(0) == "c") paramb = doComp(paramb,pointx,playernum,qen);

if (paramc.charAt(0) == "c") paramc = doComp(paramc,pointx,playernum,qen);

// check for p1 to p9

if (parama.charAt(0) == "p") parama = doPvar(parama,pointx,playernum,qen);

if (paramb.charAt(0) == "p") paramb = doPvar(paramb,pointx,playernum,qen);

// check for math units

if ((parama+"").charAt(0) == "m") parama = doMathUnit(parama,pointx,playernum,qen);

if ((paramb+"").charAt(0) == "m") paramb = doMathUnit(paramb,pointx,playernum,qen);

/*if ((paramc+"").charAt(0) == "m") paramc = doMathUnit(paramc,pointx,playernum,qen);*/

// basic variables

if (parama == "!" && playernum == 1) parama = exclam_1;

if (parama == "!" && playernum == 2) parama = exclam_2;

if (parama == "#" && playernum == 1) parama = pound_1;

if (parama == "#" && playernum == 2) parama = pound_2;

if (parama == "\$") parama = dollar;

//

if (paramb == "!" && playernum == 1) paramb = exclam_1;

if (paramb == "!" && playernum == 2) paramb = exclam_2;

if (paramb == "#" && playernum == 1) paramb = pound_1;

if (paramb == "#" && playernum == 2) paramb = pound_2;

if (paramb == "\$") paramb = dollar;

// check for e

if (parama == "e") parama = qen;

if (paramb == "e") paramb = qen;

// check for q

if (parama == "q") parama = ((pointx - playernum) - 6)/2;

if (paramb == "q") paramb = ((pointx - playernum) - 6)/2;

// check for t

if (parama == "t") parama = sumPointers(playernum);

if (paramb == "t") paramb = sumPointers(playernum);

// parama & paramb are now solid numbers

// paramc only used if EDIT

// switch statement based on cmdname:

cmdname = cmdname.toUpperCase();

parama = parama*1;

paramb = paramb*1;

var nextnode;

var nexten;

switch (cmdname)

{

case "COPY":

var copylinenuma = doMod(qline + parama);

var copylinenumb = doMod(qline + paramb);

vna[copylinenumb] = vna[copylinenuma];

nextnode = doMod(qline + 1);

nexten = qen - 1;

break;

case "JUMP":

var vptest = (parama*2)+6+playernum;

if (parama == 0 || pointx == vptest)

{

nextnode = doMod(qline + paramb);

nexten = qen - 1;

}

else

{

nextnode = doMod(qline + 1);

nexten = qen - 1;

// is the pointer # valid?

var indirecto = 0;

if (parama < 0) {parama = parama * -1; indirecto = 1;}

if (parama == 1 || parama == 2 || parama == 3 || parama == 4 || parama == 5 || parama == 6 || parama == 7 || parama == 8 || parama == 9)

{

// is the pointer in stasis?

var refpoint = (parama*2)+6+playernum;

var refline = document.form1.elements[refpoint].value;

if (refline == "stasis")

{

// create the pointer

var newspot = doMod(qline + paramb);

document.form1.elements[refpoint].value = newspot + ";" + qen;

}

else

{

// move the pointer

var newnode;

//if (indirecto==0)

//{

newnode = doMod(qline + paramb);

//}

//else

//{

//var reflinez = refline.substring(0,refline.indexOf(";"));

//reflinez = reflinez*1;

//newnode = doMod(reflinez + paramb);

//}

refline = newnode + ";" + refline.substring(refline.indexOf(";")+1);

document.form1.elements[refpoint].value = refline;

}

}

}

break;

case "EDIT":

var lineofz = doMod(qline + parama);

var stoedit = vna[lineofz];

var charx1 = paramc.charAt(0);

var charx2 = paramc.charAt(1);

var charx3 = paramc.charAt(2);

var editbase;

if (charx3 == ":") editbase = paramb;

if (charx3 == "@" || charx3 == "-" || charx3 == "x")

{

var lineofy = doMod(qline + paramb);

var storef = vna[lineofy];

storef = storef.substring(5);

var okay = new Array();

okay = storef.split(",");

var okayr;

if (charx3=="@" || charx3=="x") okayr = okay[0];

if (charx3=="-") okayr = okay[1];

// evaluate okayr into a number

if (okayr.charAt(0) == "c") okayr = doComp(okayr,pointx,playernum,qen);

if (okayr.charAt(0) == "p") okayr = doPvar(okayr,pointx,playernum,qen);

if ((okayr+"").charAt(0) == "m") okayr = doMathUnit(okayr,pointx,playernum,qen);

if (okayr == "!" && playernum == 1) okayr = exclam_1;

if (okayr == "!" && playernum == 2) okayr = exclam_2;

if (okayr == "#" && playernum == 1) okayr = pound_1;

if (okayr == "#" && playernum == 2) okayr = pound_2;

if (okayr == "\$") okayr = dollar;

if (okayr == "e") okayr = qen;

if (okayr == "q") okayr = ((pointx - playernum) - 6)/2;

if (okayr == "t") okayr = sumPointers(playernum);

okayr = okayr*1;

//

editbase = okayr;

}

var editbase2 = editbase;

sstoedit = stoedit.substring(5);

var rifty = new Array();

rifty = sstoedit.split(",");

var riftydos;

var nuline;

// take editbase and change it based on charx2 and existing parameter

if (charx1 == "a" || charx1 == "x")

{

riftydos = rifty[0];

// evaluate riftydos into a number

if (riftydos.charAt(0) == "c") riftydos = doComp(riftydos,pointx,playernum,qen);

if (riftydos.charAt(0) == "p") riftydos = doPvar(riftydos,pointx,playernum,qen);

if ((riftydos+"").charAt(0) == "m") riftydos = doMathUnit(riftydos,pointx,playernum,qen);

if (riftydos == "!" && playernum == 1) riftydos = exclam_1;

if (riftydos == "!" && playernum == 2) riftydos = exclam_2;

if (riftydos == "#" && playernum == 1) riftydos = pound_1;

if (riftydos == "#" && playernum == 2) riftydos = pound_2;

if (riftydos == "\$") riftydos = dollar;

if (riftydos == "e") riftydos = qen;

if (riftydos == "q") riftydos = ((pointx - playernum) - 6)/2;

if (riftydos == "t") riftydos = sumPointers(playernum);

riftydos = riftydos*1;

//

switch (charx2)

{

//case "~": editbase = editbase; //lol

case "+": editbase = editbase + riftydos; break;

case "*": editbase = editbase * riftydos; break;

case "%": if (editbase != 0) editbase = riftydos % editbase; break;

case "/": if (riftydos != 0) editbase = editbase % riftydos; break;

case "&": editbase = riftydos + "" + editbase; editbase = editbase*1; break;

case "^": editbase = editbase + "" + riftydos; editbase = editbase*1;

break;

case ">": editbase = Math.max(editbase,riftydos); break;

case "<": editbase = Math.min(editbase,riftydos); break;

}

nuline = stoedit.substring(0,5) + editbase + "," + rifty[1];

if (rifty.length > 2) nuline = nuline + "," + rifty[2];

stoedit = nuline;

sstoedit = stoedit.substring(5);

var rifty = new Array();

rifty = sstoedit.split(",");

}

if (charx1 == "b" || charx1 == "x")

{

if (charx3=="x")

{

okayr = okay[1];

// evaluate okayr into a number

if (okayr.charAt(0) == "c") okayr = doComp(okayr,pointx,playernum,qen);

if (okayr.charAt(0) == "p") okayr = doPvar(okayr,pointx,playernum,qen);

if ((okayr+"").charAt(0) == "m") okayr = doMathUnit(okayr,pointx,playernum,qen);

if (okayr == "!" && playernum == 1) okayr = exclam_1;

if (okayr == "!" && playernum == 2) okayr = exclam_2;

if (okayr == "#" && playernum == 1) okayr = pound_1;

if (okayr == "#" && playernum == 2) okayr = pound_2;

if (okayr == "\$") okayr = dollar;

if (okayr == "e") okayr = qen;

if (okayr == "q") okayr = ((pointx - playernum) - 6)/2;

if (okayr == "t") okayr = sumPointers(playernum);

okayr = okayr*1;

//

editbase = okayr;

}

else {editbase = editbase2;}

riftydos = rifty[1];

// evaluate riftydos into a number

if (riftydos.charAt(0) == "c") riftydos = doComp(riftydos,pointx,playernum,qen);

if (riftydos.charAt(0) == "p") riftydos = doPvar(riftydos,pointx,playernum,qen);

if ((riftydos+"").charAt(0) == "m") riftydos = doMathUnit(riftydos,pointx,playernum,qen);

if (riftydos == "!" && playernum == 1) riftydos = exclam_1;

if (riftydos == "!" && playernum == 2) riftydos = exclam_2;

if (riftydos == "#" && playernum == 1) riftydos = pound_1;

if (riftydos == "#" && playernum == 2) riftydos = pound_2;

if (riftydos == "\$") riftydos = dollar;

if (riftydos == "e") riftydos = qen;

if (riftydos == "q") riftydos = ((pointx - playernum) - 6)/2;

if (riftydos == "t") riftydos = sumPointers(playernum);

riftydos = riftydos*1;

//

switch (charx2)

{

//case "~": editbase = editbase;

case "+": editbase = editbase + riftydos; break;

case "*": editbase = editbase * riftydos; break;

case "%": editbase = riftydos % editbase; break;

case "/": editbase = editbase % riftydos; break;

case "&": editbase = riftydos + "" + editbase; editbase = editbase*1; break;

case "^": editbase = editbase + "" + riftydos; editbase = editbase*1; break;

case ">": editbase = Math.max(editbase,riftydos); break;

case "<": editbase = Math.min(editbase,riftydos); break;

}

nuline = stoedit.substring(0,5) + rifty[0] + "," + editbase;

if (rifty.length > 2) nuline = nuline + "," + rifty[2];

stoedit = nuline;

}

vna[lineofz] = stoedit;

nextnode = doMod(qline + 1);

nexten = qen - 1;

break;

case "FOOD":

nextnode = doMod(qline + 1);

nexten = qen + 3;

break;

case "SET!":

case "SET#":

case "SET\$":

// set a variable

switch (paramb)

{

case 1:

// left over from development days before the math unit

// to do SETX y,1 just do SETX m=X+y,0

// but leaving the comma 1 feature in anyway...

if (cmdname == "SET!" && playernum == 1) exclam_1 += parama;

if (cmdname == "SET!" && playernum == 2) exclam_2 += parama;

if (cmdname == "SET#" && playernum == 1) pound_1 += parama;

if (cmdname == "SET#" && playernum == 2) pound_2 += parama;

if (cmdname == "SET\$") dollar += parama;

break;

case -1:

case -2:

case -3:

case -4:

var cline = doMod(qline + parama);

var ccline = vna[cline].substring(5);

var xydata = new Array();

xydata = ccline.split(",");

var wxyz;

if (paramb == -1 || paramb == -3) wxyz = xydata[0];

if (paramb == -2 || paramb == -4) wxyz = xydata[1];

// evaluate wxyz into a number

if (wxyz.charAt(0) == "c") wxyz = doComp(wxyz,pointx,playernum,qen);

if (wxyz.charAt(0) == "p") wxyz = doPvar(wxyz,pointx,playernum,qen);

if ((wxyz+"").charAt(0) == "m") wxyz = doMathUnit(wxyz,pointx,playernum,qen);

if (wxyz == "!" && playernum == 1) wxyz = exclam_1;

if (wxyz == "!" && playernum == 2) wxyz = exclam_2;

if (wxyz == "#" && playernum == 1) wxyz = pound_1;

if (wxyz == "#" && playernum == 2) wxyz = pound_2;

if (wxyz == "\$") wxyz = dollar;

if (wxyz == "e") wxyz = qen;

if (wxyz == "q") wxyz = ((pointx - playernum) - 6)/2;

if (wxyz == "t") wxyz = sumPointers(playernum);

wxyz = wxyz*1;

//

if (paramb > -3)

{

if (cmdname == "SET!" && playernum == 1) exclam_1 = wxyz;

if (cmdname == "SET!" && playernum == 2) exclam_2 = wxyz;

if (cmdname == "SET#" && playernum == 1) pound_1 = wxyz;

if (cmdname == "SET#" && playernum == 2) pound_2 = wxyz;

if (cmdname == "SET\$") dollar = wxyz;

}

else

{

if (cmdname == "SET!" && playernum == 1) exclam_1 += wxyz;

if (cmdname == "SET!" && playernum == 2) exclam_2 += wxyz;

if (cmdname == "SET#" && playernum == 1) pound_1 += wxyz;

if (cmdname == "SET#" && playernum == 2) pound_2 += wxyz;

if (cmdname == "SET\$") dollar += wxyz;

}

break;

default:

if (cmdname == "SET!" && playernum == 1) exclam_1 = parama;

if (cmdname == "SET!" && playernum == 2) exclam_2 = parama;

if (cmdname == "SET#" && playernum == 1) pound_1 = parama;

if (cmdname == "SET#" && playernum == 2) pound_2 = parama;

if (cmdname == "SET\$") dollar = parama;

break;

}

//

nextnode = doMod(qline + 1);

nexten = qen;

break;

}

// render VNA

document.form1.vnarray.value = vna.join("\n");

// now do some checks

if (nexten < 1)

{

document.form1.elements[pointx].value = "stasis";

if (gameover == 0)

{

// check for other living pointers

for (iz=(8+playernum);iz<(25+playernum);iz=iz+2)

{

}

{

// Game Over!

gameover = 1;

var qrnd = document.form1.rnds.value;

if (document.form1.checky.checked == false)

{

if (playernum == 1) alert("Player 2 wins on round "+qrnd+"!!!");

if (playernum == 2) alert("Player 1 wins on round "+qrnd+"!!!");

}

else

{

alert("The program dies on round "+qrnd+"!");

}

document.form1.dornd.disabled = true;

document.form1.doxrnd.disabled = true;

}

}

}

else

{

// update pointer field (node;energy)

document.form1.elements[pointx].value = nextnode + ";" + nexten;

}

}

function doComp(xyz,pointx,playernum,qen)

{

xyz = xyz.substring(2);

var vvv = new Array();

vvv = xyz.split("_");

// make sure vvv[0] and vvv[1] are numbers

//  check for p1 to p9

if (vvv[0].charAt(0) == "p") vvv[0] = doPvar(vvv[0],pointx,playernum,qen);

if (vvv[1].charAt(0) == "p") vvv[1] = doPvar(vvv[1],pointx,playernum,qen);

// math unit

if ((vvv[0]+"").charAt(0) == "m") vvv[0] = doMathUnit(vvv[0],pointx,playernum,qen);

if ((vvv[1]+"").charAt(0) == "m") vvv[1] = doMathUnit(vvv[1],pointx,playernum,qen);

// basic variables

if (vvv[0] == "!" && playernum == 1) vvv[0] = exclam_1;

if (vvv[0] == "!" && playernum == 2) vvv[0] = exclam_2;

if (vvv[0] == "#" && playernum == 1) vvv[0] = pound_1;

if (vvv[0] == "#" && playernum == 2) vvv[0] = pound_2;

if (vvv[0] == "\$") vvv[0] = dollar;

//

if (vvv[1] == "!" && playernum == 1) vvv[1] = exclam_1;

if (vvv[1] == "!" && playernum == 2) vvv[1] = exclam_2;

if (vvv[1] == "#" && playernum == 1) vvv[1] = pound_1;

if (vvv[1] == "#" && playernum == 2) vvv[1] = pound_2;

if (vvv[1] == "\$") vvv[1] = dollar;

// check for e

if (vvv[0] == "e") vvv[0] = qen;

if (vvv[1] == "e") vvv[1] = qen;

// check for q

if (vvv[0] == "q") vvv[0] = ((pointx - playernum) - 6)/2;

if (vvv[1] == "q") vvv[1] = ((pointx - playernum) - 6)/2;

// check for t

if (vvv[0] == "t") vvv[0] = sumPointers(playernum);

if (vvv[1] == "t") vvv[1] = sumPointers(playernum);

// validate

vvv[0] = vvv[0]*1;

vvv[1] = vvv[1]*1;

// vvv[0,1] are pure numbers now

//

if (vvv[0] == vvv[1])

{

return vvv[2];

}

else if (vvv[0] > vvv[1])

{

return vvv[3];

}

else

{

return vvv[4];

}

}

function doPvar(pvar,pointx,playernum,wxen)

{

if (pvar == "pq") return 0;

pvar = pvar.charAt(1);

// parse if variable

if (pvar == "!" && playernum == 1) pvar = exclam_1;

if (pvar == "!" && playernum == 2) pvar = exclam_2;

if (pvar == "#" && playernum == 1) pvar = pound_1;

if (pvar == "#" && playernum == 2) pvar = pound_2;

if (pvar == "\$") pvar = dollar;

if (pvar == "e") pvar = wxen;

if (pvar == "t") pvar = sumPointers(playernum);

// if (pvar == "q") pvar = ((pointx - playernum) - 6)/2;

//

if (pvar != 1 && pvar != 2 && pvar != 3 && pvar != 4 && pvar != 5 && pvar != 6 && pvar != 7 && pvar != 8 && pvar != 9) return 600;

pvar = pvar*1;

pvar = (pvar*2)+6+playernum;

var curline = document.form1.elements[pointx].value;

var desline = document.form1.elements[pvar].value;

if (desline == "stasis") return 300;

var xrz = new Array();

xrz = curline.split(";");

curline = xrz[0]*1;

xrz = desline.split(";");

desline = xrz[0]*1;

return doMod(desline - curline);

}

function doMathUnit(mathstring,pointx,playernum,qen)

{

mathstring = mathstring.substring(2);

var referstring = "+-*%&><";

var qchar;

var zchar;

for (gn=0;gn<referstring.length;gn++)

{

zchar = referstring.charAt(gn);

if (mathstring.indexOf(zchar) != -1) {qchar = zchar; break;}

}

var mathparts = new Array();

mathparts = mathstring.split(qchar);

// turn the math parts into numbers

if (mathparts[0].charAt(0) == "p") mathparts[0] = doPvar(mathparts[0],pointx,playernum,qen);

if (mathparts[0] == "!" && playernum == 1) mathparts[0] = exclam_1;

if (mathparts[0] == "!" && playernum == 2) mathparts[0] = exclam_2;

if (mathparts[0] == "#" && playernum == 1) mathparts[0] = pound_1;

if (mathparts[0] == "#" && playernum == 2) mathparts[0] = pound_2;

if (mathparts[0] == "\$") mathparts[0] = dollar;

if (mathparts[0] == "e") mathparts[0] = qen;

if (mathparts[0] == "q") mathparts[0] = ((pointx - playernum) - 6)/2;

if (mathparts[0] == "t") mathparts[0] = sumPointers(playernum);

mathparts[0] = mathparts[0]*1;

//

if (mathparts[1].charAt(0) == "p") mathparts[1] = doPvar(mathparts[1],pointx,playernum,qen);

if (mathparts[1] == "!" && playernum == 1) mathparts[1] = exclam_1;

if (mathparts[1] == "!" && playernum == 2) mathparts[1] = exclam_2;

if (mathparts[1] == "#" && playernum == 1) mathparts[1] = pound_1;

if (mathparts[1] == "#" && playernum == 2) mathparts[1] = pound_2;

if (mathparts[1] == "\$") mathparts[1] = dollar;

if (mathparts[1] == "e") mathparts[1] = qen;

if (mathparts[1] == "q") mathparts[1] = ((pointx - playernum) - 6)/2;

if (mathparts[1] == "t") mathparts[1] = sumPointers(playernum);

mathparts[1] = mathparts[1]*1;

//

var retxval;

switch (qchar)

{

case "+": retxval = mathparts[0] + mathparts[1]; break;

case "-": retxval = mathparts[0] - mathparts[1]; break;

case "*": retxval = mathparts[0] * mathparts[1]; break;

case "%":

if (mathparts[1] != 0)

{retxval = mathparts[0] % mathparts[1];}

else {retxval = mathparts[0];}

break;

case "&": retxval = mathparts[0] + "" + mathparts[1]; retxval *= 1; break;

case ">": retxval = Math.max(mathparts[0],mathparts[1]); break;

case "<": retxval = Math.min(mathparts[0],mathparts[1]); break;

}

return retxval;

}

function sumPointers(pnum)

{

var pointercount = 0;

for (izz=(8+pnum);izz<(25+pnum);izz=izz+2)

{

if (document.form1.elements[izz].value != "stasis") pointercount++;

}

return pointercount;

}

function showVars()

{

alert("VARIABLES: \n! (P1) = "+exclam_1+"\n! (P2) = "+exclam_2+"\n# (P1) = "+pound_1+"\n# (P2) = "+pound_2+"\n\$ = "+dollar);

}

function showHelp()

{

alert("HELP: \n* Put the two programs in the P1 and P2 text fields\n* You can use the 'Switch' and 'Clear' buttons to switch and clear the P1 & P2 fields respectively\n* If you check the checkbox, only P1 will run (though P2 will still be put into the VNA if you put something for it). This is helpful for debugging a program or seeing when/if it dies of natural causes\n* Enter a number for P2 starting node in the range given, or click the button to generate one randomly\n* Click the load button to initialize everything\n* After that, you can see the VNA as well as pointer statistics and rounds. A pointer has its node reference on the first number, then a semicolon, then its energy\n* To do a round, click the Do 1 Round button\n* To do multiple rounds at a time, enter a value for X (default is 10) and click the 'Do X Rounds' button\n* To see the variables in their current state, click the 'See Variables' button\n* To change the number of rows displayed of the VNA, click the button in the bottom right corner. The default is 40, though I choose 15-20 if I want to see all the data at once - choose what works best for you and your browser\n* To get a line number after the VNA is filled, place the cursor in the middle of the line and look at the text field on the bottom. It's kind of a slow feature though\n* Enjoy;D");

}

function changeArrayH()

{

var newheight = prompt("New textarea height (in rows):",document.form1.vnarray.rows);

if (newheight != 0 && newheight != null) document.form1.vnarray.rows = newheight;

}

function doClickArray()

{

var objx = document.form1.vnarray;

var xout;

if(objx.selectionStart)

{

/*

if doesn't work, delete this func, and onClick of vnarray, and the text & input before div right

*/

var startx = objx.selectionStart;

var newlcount = 0;

for (trx=0;trx<startx;trx++)

{

if (objx.value.charAt(trx) == "\n") newlcount++;

}

xout = newlcount;

}

else

{

xout = "Need Firefox & Filled VNA";

}

document.form1.curatline.value = xout;

}

</script>

<body>

<h1>VNA 3.0 Emulator, by unreality</h1><form name="form1"><br><br><br>P1 ................................................................................

..........................P2<br>

<textarea name="p1" rows=10 cols=50></textarea>

<textarea name="p2" rows=10 cols=50></textarea>

<br>

<center>

<input type="button" value="Switch" onClick="doSwitch();">

<input type="button" value="Clear" onClick="doClear();"> ... <input type="checkbox" name="checky"> Check if just testing P1 [no P2]</center>

<br><br><br><br>

P1 starts at line 0 and goes first<br>

P2 starts at line X and goes second<br>

X: <input type="text" name="startline" length="10">

<input type="button" value="Random" onClick="doRandomStart();">

<br><br><br><br>

VNA:<br>

<textarea name="vnarray" onClick="doClickArray();" rows=40 cols=60></textarea><br>

P1_1: <input type="text" name="pt1_1" length="10"> .... P2_1: <input type="text" name="pt2_1" length="10"><br>

P1_2: <input type="text" name="pt1_2" length="10"> .... P2_2: <input type="text" name="pt2_2" length="10"><br>

P1_3: <input type="text" name="pt1_3" length="10"> .... P2_3: <input type="text" name="pt2_3" length="10"><br>

P1_4: <input type="text" name="pt1_4" length="10"> .... P2_4: <input type="text" name="pt2_4" length="10"><br>

P1_5: <input type="text" name="pt1_5" length="10"> .... P2_5: <input type="text" name="pt2_5" length="10"><br>

P1_6: <input type="text" name="pt1_6" length="10"> .... P2_6: <input type="text" name="pt2_6" length="10"><br>

P1_7: <input type="text" name="pt1_7" length="10"> .... P2_7: <input type="text" name="pt2_7" length="10"><br>

P1_8: <input type="text" name="pt1_8" length="10"> .... P2_8: <input type="text" name="pt2_8" length="10"><br>

P1_9: <input type="text" name="pt1_9" length="10"> .... P2_9: <input type="text" name="pt2_9" length="10"><br>

<center>

<input type="button" value="Do 1 Round" name = "dornd" onClick="doRound();"> <input type="button" value="Do X Rounds" name="doxrnd" onClick="doXRounds();"> X:<input type="text" name="xrd" length="10"></center><br>

Rounds: <input type="text" name="rnds" length="10"> <center> <input type="button" value="See Variables" onClick="showVars();"> <input type="button" value="Help" onClick="showHelp();"></center><br><div align="right"><input type="button" value="Change VNA textarea height" onClick="changeArrayH();"></div><br>Cursor Located at Line: <input type="text" name="curatline" length="12"> <font size=1>(Warning - this feature is slow, lol)</font>

</form>

</body>

</html>```

~ Note that my code uses a method called .split which is not supported by Netscape 2 and Explorer 3

~ Also, if you find any bugs/errors in the emulator, please PM me immediately ;D

## Recommended Posts

• 0

Okay, got the basics down. I wanted to see if I could write a program that would beat Unreality's sample of

COPY 4,10

EDIT -1,2,b+:

FOOD 0,0

JUMP 0,-3

JUMP 0,100

and

COPY 2,4

FOOD 0,0

FOOD 0,0

JUMP 0,-2

beat it during around 450.

That probably isn't that great, but still.

##### Share on other sites
• 0
Okay, got the basics down. I wanted to see if I could write a program that would beat Unreality's sample of

COPY 4,10

EDIT -1,2,b+:

FOOD 0,0

JUMP 0,-3

JUMP 0,100

and

COPY 2,4

FOOD 0,0

FOOD 0,0

JUMP 0,-2

beat it during around 450.

That probably isn't that great, but still.

cool i'd love to see it.

##### Share on other sites
• 0

Gah, I suck at this. /shall save you guys from losing rants and take a break for a while..

##### Share on other sites
• 0

don't get your discouraged, you're doing great I call the kind of program you made a "guzzler"

COPY 2,4

FOOD 0,0

FOOD 0,0

JUMP 0,-2

a shorter example would be something like

FOOD 0,0

JUMP 0,-1

which has less vulnerable spots. The sample bomber I gave:

COPY 4,10

EDIT -1,2,b+:

FOOD 0,0

JUMP 0,-3

JUMP 0,100

doesn't have a "defense clause" or "non-self-destruct clause" that prevents it from bombing itself. This means that it will rip itself apart if it hasn't already won/lost by a certain amount of time. When planning a bomber, it's always important to make sure it can't destroy itself (or other pointers the program is running).

Anyway, you're doing really good for a first-time programmer, so don't get discouraged You should pick apart some of the programs me and DMS have made and see how they work - you'll get the hang of it in no time and you'll be kicking our @sses ;D

##### Share on other sites
• 0

As soon as the Wi-Fi I'm stealing from my neighbors stops being lame and works again, I'm going to download it onto my iTouch, which should give me plenty of time to play around with it.

I looked at the programs in DMS's sig, and my initial reaction was basically . Then I read into of just looking at it as a huge line of code. What does the "set" command do?

##### Share on other sites
• 0

SET!, SET# and SET\$ are used for setting variable values. They're in the spoilers of the OP

##### Share on other sites
• 0

As soon as the Wi-Fi I'm stealing from my neighbors stops being lame and works again, I'm going to download it onto my iTouch, which should give me plenty of time to play around with it.

I looked at the programs in DMS's sig, and my initial reaction was basically . Then I read into of just looking at it as a huge line of code. What does the "set" command do?

yea that was my first reaction in vna2 when i saw unreality's huge programs. just keep trying and asking lots of questions and it will make sense soon. also don't let red hopper gone crazy's size scare you it's really not to good of a program.

Edited by dms172

##### Share on other sites
• 0

So my work on hoppers was semi-conclusive I tried to make a more definite formula but this patterns the behavior:

n(j,d) = (300z + d)/j

j = jump constant of the hopper, ie, how many nodes forward your hopper moves on each jump

z = lowest integer possible so as to make 'n' an integer. z is the hard part ;D

d = distance to check for. 'n' as a function of j&d will return how many iterations [jumps] it takes to reach a distance of +d from the original position. If you want to see how long it will take to get back to the original position (that is, d = 0), then there is a much simpler case:

n(j,0) = 300/j -> reduce to lowest terms -> take numerator

for nonzero d's, it's a bit trickier. It gets into integer-algebra and Diophantine analysis. I've concluded that there are two ways to calculate n that are essentially the same thing:

* iterate the formula (300z+d)/j where 'z' changes each time, starting at 1 and adding one each time. Stop when you get a whole number result, this is 'n'. After z=300, all possibilities are exhausted, and if no value for 'n' has been reached, it means the hopper cannot land on that distance

* while the above way may be efficient for a computer program, it's not easy to do it with a simple piece of paper or calculator. A different method is to repeatedly write down multiples of 'j', starting with 'j' itself. From each one, mentally subtract 'd' and see if the result is a multiple of 300 [which is easy to spot at a glance]. If it is, divide the 'j'-multiple (with 'd' not subtracted) by 'j' to get the result, 'n'. If no multiple up to 300*j works, it is impossible

edit - I was going to write a computer program that calculates for you based on j,d input, but didn't have time. Probably tomorrow!

example of impossible:

n(30,7)

30 is divisible evenly by 300, so just after 10 loops it'll be back to the starting place (ie, n(30,0) = 10). This means that it can never land on a spot not a multiple of 30, therefore it can't land at a 'd' of +7

To clarify, I'm assuming this is referenced from the first line (usually COPY) of the hopper. Depending on the length of the hopper, the end of it may touch a node. If it is 4 nodes long and you want to know if the very last line (+3 from the first one) touches +20, you would test n(j,20-3) or n(j,17)

Anyway, that's just theoretical math about hoppers

~~

On to my newer programs ;D

This one, called Caravanserai [the name may make sense after some inspection or after running it] is slow and not very polished, and probably not that good of a battler (at ALL lol), but it's more of an interesting thing than a battler. Its pointer #1 continually creates "hoops" spaced evenly about the VNA. Then it disperses pointers #3-#8 (#2 is a guzzler backup) to "jump the hoops" and just dance around the VNA. The hoops look like this:

FOOD 0,0

JUMP 0,49

and are spaced 50 apart, so they're continually on a run around the VNA. Enemy pointers may be trapped too, that's actually the point. Meanwhile, pointer #9 bombs sporadically [why not] and keeps track of rounds basically. After 100 of its loops since its creation [this number should be tweaked; there are 3 or 4 rounds per loop so it amounts to a long time, should probably be shortened], pointer #9 flicks to a second mode, 'recalling' all of the pointers into pointer #2's guzzler... then it effectively replaces the hoops with bombs (it doesn't do it itself but delegates the task to #1 who was sitting there re-reinforcing the hoops the whole time - #9 just overwrites its base-hoop to a bomb) so that an enemy pointers trapped in the cycles will die. Then #9 goes back to its lame bombing attempts and 2-8 guzzle it up. If the enemy isn't dead after that, Caravanserai failed.

... failure is most likely, but it's just a prototype ;D

JUMP 2,9

SET! 50,0

FOOD 0,0

COPY 4,m=4+!

COPY 4,m=4+!

SET! c_!_250_0_m=!+50_m=!+50,0

JUMP 0,-4

FOOD 0,0

JUMP 0,49

FOOD 0,0

JUMP 0,c_!_250_1_1_-1

JUMP m=q+1,0

JUMP 0,c_q_2_9_m=q-2_0

JUMP 0,-5

JUMP 0,44

JUMP 0,93

JUMP 0,142

JUMP 0,191

JUMP 0,240

FOOD 0,0

JUMP 0,-1

FOOD 0,0

SET# m=#+1,0

SET\$ c_\$_250_50_50_m=\$+50,0

COPY 2,\$

JUMP 0,c_#_100_2_-4_-4

JUMP 0,0

JUMP m=q+1,0

JUMP 0,c_q_2_1_-9_-9

COPY -3,-22

JUMP 0,-9

now I have made a second program, called Scythe II, and this is the opposite of Caravanserai lol. Scythe II is fast, efficient and deadly. It improves on my original Scythe.... we'll see how Scythe II does in the ring I won't reveal it publicly but I'd like to challenge anyone to combat it. We'll make our programs separately so as to not craft them after the style of the other [though I've already made mine] and then we'll battle ;D

Edited by unreality

##### Share on other sites
• 0

Okay, questions.

1. If COPY drops a 'bomb', how much damage does it do/can I change the amount of damage?

2. What's the point of JUMPing from the current line up 100 lines?

##### Share on other sites
• 0

there's no such thing as "damage" lol. A pointer dies (goes into stasis) when its energy drops to 0. An effective way of forcing this is to use COPY to drop a "JUMP 0,0" line, which will cause the pointer to jump on that line over and over again until it dies. However, there are other choices of bombs (such as "JUMP 0,100") which have other positives and negatives to them. For some basic bombs & more complex bombs and discussion of their positives and negatives, see the spoiler in the OP entitled Tips and Tricks and Bombs.

For the emulator, if for some reason you can't download the raw html file, just open up the emulator spoiler and open up the secondary spoiler. That contains the html & javascript code you need. Just copy that whole code and paste it into a text file. Save the text file as "vna2.html" onto your desktop or wherever. Then drag it onto your browser (Firefox, Chrome, IE, Safari, Opera, Gecko, whatever you have)

[edit - typo]

Edited by unreality

##### Share on other sites
• 0

Gah, still confused. Sorry. When I use COPY, it forces the other program to JUMP to a certain line of its code?

##### Share on other sites
• 0

uh, what? Lol COPY does exactly what it says. COPY a,b will copy line 'a' to line 'b'.

I was just saying that you can use COPY to drop malicious code segments on the enemy, ie, to 'bomb' them

Edited by unreality

##### Share on other sites
• 0

But what I mean is, how does copying parts of my code affect the enemy? Do I copy line a of my code and insert it into lime b of theirs?

##### Share on other sites
• 0

Yeah, that's how a bomber works. It usually has a line or so that's effectively a pointer-killer (like 'JUMP 0,0') inside its program that it never actually runs itself, but rather systematically copies it around the VNA, hoping to hit the enemy

##### Share on other sites
• 0

i'd like to challenge your Scythe II with me speedy(from my sig). ii think i'll win cuz you can't bomb any faster then speedy, but we'll see.

##### Share on other sites
• 0

you're on

This is Scythe II:

JUMP m=q+1,c_q_8_5_0_0

FOOD 0,0

COPY 2,m=!+q

JUMP 0,-2

JUMP 0,0

SET! c_!_270_45_45_m=!+30,0

FOOD 0,0

JUMP 0,-2

and I'm using this from your sig as speedy:

jump m=1+q,0

copy 23,m=245+q

copy 22,m=54+q

copy 21,m=208+q

copy 20,m=76+q

copy 19,m=186+q

copy 18,m=98+q

copy 17,m=109+q

copy 16,m=164+q

food 0,0

copy 14,m=142+q

copy 13,m=131+q

copy 12,m=153+q

food 0,0

copy 10,m=120+q

copy 9,m=175+q

copy 8,m=87+q

food 0,0

copy 6,m=197+q

copy 5,m=65+q

food 0,0

food 0,0

food 0,0

jump 0,-22

jump 0,0

I'll run the battle now and post the results

##### Share on other sites
• 0

cool, i just realized a problem i made when i was editing my program, so i'm going to change that now. can't wait to see the results

##### Share on other sites
• 0

Alright, I have the results Sorry about the time - I had to break to eat dinner

I organized the game into matches, of which I ran 7. For each match, I generated a random starting loc and then flipped the two programs with the same starting loc, so each match has two games (except the match where it generated 150 because that would be the same game if flipped, so that just had 1)

Key:

sp = speedy

sc = Scythe II

Match Number

starting locs ------- winner +round number of victory

Match One: 127

sc 0, sp 127 ------- sp 25

sp 0, sc 127 ------- sc 38

Match Two: 175

sc 0, sp 175 ------- sc 34

sp 0, sc 175 ------- sp 25

Match Three: 61

sc 0, sp 61 ------- sc 10

sp 0, sc 61 ------- infinite ~ sp destroyed sc's bombing component, leaving just the guzzler/editor to loop forever while sp rebombed the same places

Match Four: 223

sc 0, sp 223 ------- infinite ~ neither program overwrote the other, they just missed most of each other's code and then didn't affect each other after that

sp 0, sc 223 ------- sc 18

Match Five: 101

sc 0, sp 101 ------- infinite ~ sp destroyed sc's bombing component, leaving just the guzzler/editor to loop forever while sp rebombed the same places

sp 0, sc 101 ------- sp 34

Match Six: 150 [one game only as a flip would be the same]

sc 0, sp 150 ------- sp 30

Match Seven: 182

sc 0, sp 182 ------- sp 25

sp 0, sc 182 ------- sc 14

WINS

m1: sp,sc

m2: sc,sp

m3: sc,inf

m4: inf,sc

m5: inf,sp

m6: sp

m7: sp,sc

13 games were played, of which speedy won 5, Scythe II won 5, and 3 were infinite ties.

So you may think it's a tie, but of the infinity-games, one infinity was an even tie, but in the other two, speedy was the dominant player, wiping most of Scythe II, even though Scythe II clung to life with the backup-guzzler-editer pointer.

So I declare speedy the winner and the better program

I've had an idea for Scythe 2.2, which would bomb in sections of 45 not 30, allowing to faster VNA coverage, and I think that may have fared better against speedy gonzales, but not sure - speedy is a good program ;D

However it has a weakness similar to the original Scythe's, which is that all the pointers are in one basket, so to speak, and a single dropped bomb could fell all 9. Speedy's other weakness was that it could only do one sweep - after that, it bombs the exact same places all over again. Scythe lasts for two sweeps, then repeats, I was trying to find ways to improve on that but they weren't practical to impliment, at least for Scythe II. However, for speedy I could see a possible way to make it work.

Anyway, despite those shortcomings, speedy's speed definitely overcomes it Great program DMS! Congrats!

##### Share on other sites
• 0

thank you, but that still seems like a tie to me though

that problem is almost fixed, but there's a little error somewhere so none of the copies are working

jump m=1+q,0

copy 24,m=243+q

copy 23,m=54+q

copy 22,m=229+q

copy 21,m=64+q

copy 20,m=215+q

copy 19,m=74+q

copy 18,m=201+q

copy 17,m=84+q

food 0,0

copy 15,m=186+q

copy 14,m=94+q

copy 13,m=172+q

food 0,0

copy 11,m=104+q

copy 10,m=157+q

copy 9,m=114+q

food 0,0

copy 7,m=142+q

copy 6,m=124+q

copy 5,m=128+q

food 0,0

food 0,0

jump 0,-2

jump 0,0

Edited by dms172

##### Share on other sites
• 0

Yeah, you mean a functional error, not an actual syntax error.

The functional error is because the numbers are referencing the line +1 from the ending as the bomb. You could subtract 1 from the a-parameters of all of the COPYs, or just add one more line to the end:

JUMP 0,0

and that should work

Edited by unreality

##### Share on other sites
• 0

thanks again, i see what i did now.

i changed it to end as a guzzler but when i did that i took out 1 food 0,0 and that threw the whole thing off.

##### Share on other sites
• 0

i decided to redo the battle to see how my improved version worked

Key:

sp = speedy

sc = Scythe II

Match Number

starting locs ------- winner +round number of victory

Match One: 58

sc 0, sp 58 ------- sp 15

sp 0, sc 58 ------- sp 15

Match Two: 159

sc 0, sp 159 ------- sp 45

sp 0, sc 159 ------- sc 18

Match Three: 91

sc 0, sp 91 ------- sp 25

sp 0, sc 91 ------- sp 25

Match Four: 230

sc 0, sp 230 ------- sp 20

sp 0, sc 230 ------- sp 15

Match Five: 170

sc 0, sp 170 ------- sp 40

sp 0, sc 170 ------- sc 30 ~ this was the best i took out program and you were down to your last bomb. it took out the very tip of my guzzler and killed me.

so the score was sp=8 and sc=2

Edited by dms172

##### Share on other sites
• 0

nice Scythe has a clever auto-editing feature [using pointers] but Speedy emerges the clear victor - I see a couple ways to improve speedy, do I mind if I make a speedy 2.0? It could be a collaborative thing

Also sorry for not posting on here for a while, been busy

##### Share on other sites
• 0
nice Scythe has a clever auto-editing feature [using pointers] but Speedy emerges the clear victor - I see a couple ways to improve speedy, do I mind if I make a speedy 2.0? It could be a collaborative thing

Also sorry for not posting on here for a while, been busy

it's fine with me. i already used your red hopper. i was thinking of outing 2 scans in to scan the front and back and decide which way it would bomb.

##### Share on other sites
• 0

Is anyone still playing with VNA?

I am new to these forums and found this game particularly interesting.

I wrote a program I will call "Slave driver" that, to use terms I saw in earlier posts, is basically a guzzler feeding a crawler:

SET! 56,0

FOOD 0,0

JUMP 0,c_t_2_-1_-1_1

FOOD 0,0

JUMP 2,m=!+0

COPY 3,p2

SET! m=!+e,0

JUMP 0,-6

COPY 0,1

It seems to beat either Speedy or Scythe almost every time but loses to the hopper based programs.

If anyone is still interested in VNA I will try to write some better programs.

## Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

×   Pasted as rich text.   Paste as plain text instead

Only 75 emoji are allowed.

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

×