0-9

Inputs

Outputs

  • Constant

Neuron type

Best algorithm has been found - locked

Patterns

Pattern Input Output
1.
Constant: 0-9

Applicable neurons

  • 0
  • 9
  • character -
  • Connect - three inputs
  • character ]
  • Distance (by Torque, Force)
  • right angled triangle, find Hypotenuse c, given a, b
  • Get first letter
  • (a, b]
  • a + b; a - b
  • character s
  • n+
  • select count (A, B, C)
  • Prepend zero to two characters

Algorithm

Test

Code made by AI:
/**
 * 9: 
 *
 * @return {Array}
 */
function neuron509()
{
return [9];
}

/**
 * character -: 
 *
 * @return {Array}
 */
function neuron511()
{
return['-'];
}

/**
 * 0: 
 *
 * @return {Array}
 */
function neuron500()
{
return [0];
}

/**
 * Connect - two inputs: 
 *
 * @param x1 Variable A
 * @param x2 Variable B
 * @return {Array}
 */
function neuron520(x1, x2)
{
return [x1.toString()+x2.toString()];
}

/**
 * Connect - three inputs: Connect stringA + stringB + stringC
 * 
 * @param x1 string A
 * @param x2 string B
 * @param x3 string C
 * @return {Array}
 */
function neuron564(x1, x2, x3)
{
  var outputs = [];
  outputs[0] = x1;
  outputs[1] = x2;
  outputs[2] = x3;

  arr = neuron520(outputs[1], outputs[2]);
  outputs[3] = arr[0];

  arr = neuron520(outputs[0], outputs[3]);
  outputs[4] = arr[0];

  return[outputs[4]];
}


/**
 * 0-9: 
 * 
 * @return {Array}
 */
function neuron770()
{
  var outputs = [];

  arr = neuron509();
  outputs[0] = arr[0];

  arr = neuron511();
  outputs[1] = arr[0];

  arr = neuron500();
  outputs[2] = arr[0];

  arr = neuron564(outputs[2], outputs[1], outputs[0]);
  outputs[3] = arr[0];

  return[outputs[3]];
}


Code made by AI:

Create your family tree for free