ConwayLife.com

Code: Select all

//Javascript code to calculate arrays via recursive formula
//Can handle cases where no starting numbers are required or used
//Able to handle an arbitrarily large amount of starting numbers
//"n_m" is the "m" most recent number added to the array
//Format: sampi([first term, second term, etc.],'formula', length of output array)
function sampi()
    {var n = (eval(arguments[0]));//just in case no starting number was input, evaluate before starting array
    var recursiveoutput = [n];
    var i;var k=0//initializing variables used in loops
     var recursionformula =(arguments[(arguments.length -2)])//store the formula, it'll likely need changing
     recursionformula=recursionformula.replace(/(-)+/g,'+-1*')//allow subtraction of recursive variables
    for(i = 1; i < (arguments.length -2); i++)//for each of the starting numbers
        {n = (arguments[i]);
        recursiveoutput.push(n)}//build the start of the array, one step at a time
    for(i = (arguments.length-2); i < (arguments[(arguments.length -1)]); i++)
//start of the recursion formula checker, doesn't overwrite starting numbers or go past output length
    {if (recursionformula.match(/(n_)(\d)+/g) === null) {var newrecursionformula=recursionformula} 
//can't replace something that doesn't exist
else {var q=recursionformula.match(/(n_)(\d)+/g).map(function(z)
//look for numbers defined by recursion
               {return z.replace(z,(recursiveoutput[(recursiveoutput.length)-z.match (/\d/)]))})
//get numbers based on outputs and/or starting numbers
    let k=0
  var newrecursionformula=(recursionformula.replace(/(n_)(\d)+/g,function()
 {return q[k++]}))}//set the recursively defined numbers to their current values
     n = eval(newrecursionformula)//calculate the next number in the array
         recursiveoutput.push(n)}//put number in and move to next step
         if (arguments[(arguments.length -1)] < recursiveoutput.length) {recursiveoutput.pop()}
//should only apply if there are exactly two arguments, unless bad code was evaluated
    return(recursiveoutput)}//the output and final result
//Unless someone else came up with this first, no rights reserved.

Code: Select all

main.c:1:15: warning: __VA_ARGS__ can only appear in the expansion of a C99 variadic macro
 #define macro(__VA_ARGS__, ...) __VA_ARGS__
               ^
main.c:1:28: error: duplicate macro parameter "__VA_ARGS__"
 #define macro(__VA_ARGS__, ...) __VA_ARGS__
                            ^~~

Code: Select all

67o

Code: Select all

x = 33, y = 36, rule = B3/S23
12b2o2b3ob3ob3obobo$12bobobobobo3bo3bobo$12bobobobobobobobo2bo$12bobob
obobobobobo2bo$12b2o2b3ob3ob3o2bo2$12b2o2b3ob3o$12bobobobobo$12bobobob
obobo$12bobobobobobo$3bob2o5b2o2b3ob3o$3b2obo$12bobobobobob3ob2o2bo$
12bobobobobo2bo2bobobo$12bobobob3o2bo2b2o2bo$12bobobobobo2bo2bobobo$
13bobo2bobob3obobob3o10$8b2o$2o6b2o$2o3$13b2o$13b2o$4b2o$3bobo$4bo!

Code: Select all

x = 26, y = 31, rule = B36/S23
16b2o$16b2o5$5b2o2b3ob3ob3obobo$5bobobobobo3bo3bobo$5bobobobobobobobo
2bo$5bobobobobobobobo2bo$5b2o2b3ob3ob3o2bo2$5b2o2b3ob3o$2o3bobobobobo$
2o3bobobobobobo$5bobobobobobo$5b2o2b3ob3o2$5bo3bobobob3ob2o2bo$5bo3bob
obo2bo2bobobo$5bobobob3o2bo2b2o2bo$5bobobobobo2bo2bobobo$6bobo2bobob3o
bobob3o5$11bo$11b3o$14bo$13b2o!

Code: Select all

x = 39, y = 18, rule = B3/S2-i34q
37b2o$2o2b3ob3ob3obobo18b2o$obobobobo3bo3bobo$obobobobobobobo2bo$obobo
bobobobobo2bo$2o2b3ob3ob3o2bo2$2o2b3ob3o$obobobobo$obobobobobo$obobobo
bobo$2o2b3ob3o2$o3bobobob3ob2o2bo$obobobobo2bo2bobobo$obobob3o2bo2b2o
2bo$obobobobo2bo2bobobo$bobo2bobob3obobob3o!

Code: Select all

x = 34, y = 44, rule = B2ck3ajnr4rw5jy6kn/S01c2aik3cjn4eiknw5ajqry6cek7e
25bo3$11bo4$27bo11$13b2o2b3ob3ob3obobo$13bobobobobo3bo3bobo$13bobobobo
bobobobo2bo$13bobobobobobobobo2bo$13b2o2b3ob3ob3o2bo2$13b2o2b3ob3o$13b
obobobobo$13bobobobobobo$13bobobobobobo$13b2o2b3ob3o$6bo$13bobobobobob
3ob2o2bo$13bobobobobo2bo2bobobo$13bobobob3o2bo2b2o2bo$13bobobobobo2bo
2bobobo$14bobo2bobob3obobob3o3$o2$17bo3$12bo$26bo!

Code: Select all

!dyk