TwistyPuzzleLib

// the signature must contain ceil( 12*(N-1)^2 / 64 ) bytes.

// a pyraminx of size N has 4 + 6*(N-1)(N-2) places two adjacent cubies can be 'glued' so much less.

  private static int computeNum()

    {

    int max = MAX_SUPPORTED_SIZE-1;

    int ret = (int)(0.99f + (12*max*max)/64.0f);

    return Math.max(ret,giga);

    }

    ArrayList<float[]> mTouch = new ArrayList<>();

    for(int i=0; i<numCubits; i++)

      {

      float[] first = getPosition(i,centers,numVariants);

          float zc = (tz+oz)/2;

          float[] touch = new float[] {xc, yc, zc};

          mTouch.add(touch);

          }

        }