var order=[];   // Order of numbers in the puzzle

var bigSz=250;  // Size of the big circle

var smallSz=50;  // Size of number circles

var finalOrd=[];    // Order of final numbers. 

var autoMode=false;   // AutoSolver

var swapsComplete=false; // Used to reset final order

var customOrder=[];

var avg;

var numSolves=0;

var numMoves=0;

var totalMoves=0;

​

function setup() {

  createCanvas(400, 400);

  for(var i=0; i<count; i++)

  {

  if(customOrder.length<count)

  {

  order.push(i+1);   

    }

  else

  {

  order.push(customOrder[i]);  

  }

  }

​

}

​

​

​

​

​

function draw() {

  background('white');

  fill('rgb(0,206,209)')

  circle(width/2, height/2, bigSz);

​

    fill('grey');

  ang=270;

  x=(bigSz/2 * cos(radians(ang)) + width/2);

  y=(bigSz/2 * sin(radians(ang)) + height/2);

  circle(x,y, smallSz*1.5);

  ang2=(360/12) *4;

  x=(bigSz/2 * cos(radians(ang2)) + width/2);

  y=(bigSz/2 * sin(radians(ang2)) + height/2);

  circle(x,y, smallSz*1.5);

  var ang=360/count; // Evenly spread out numbers

  for(var i=0; i<count; i++)

    {

    //x3 = (bmht * Math.cos(angle+offset)) + x2;

    //y3 = (bmht * Math.sin(angle+offset)) + y2;

    var x= (bigSz/2 * cos(radians(ang*i+270)) + width/2);

    var y= (bigSz/2 * sin(radians(ang*i+270)) + height/2);

    if(i==0)

    {

    fill('white');  

    }

    else

    {

    fill('white');

    }

    circle(x,y, smallSz);

    fill('black');

    textSize(20);

    textAlign(CENTER);

    textStyle(BOLD);

    text(order[i], x,y+5);  

    }

textSize(12);

textAlign(LEFT);

text("Moves this solve: " + numMoves, 0, 350);

​

​

if(autoMode)

{

frameRate(3)

textSize(12);

textAlign(LEFT);

text("Moves this solve: " + numMoves, 0, 350);

text("Solves: " + numSolves, 0, 360);

if(avg)

{

text("Average: " + nf(avg,0,2), 0, 375);

}

autoSolve();

}

else

{

frameRate(60);  

}

}

​

​

​

​

function keyPressed()

{

//console.log(keyCode);

switch(keyCode)

  {

    case 39: moveRight();

      break;

    case 37: moveLeft();

    break;

    case 32: swap();

    break;

    case 77: mix();

    break;

    case 65: //autoSolve();

      autoMode=!autoMode

      break;   

  }

}

​

​

​

​

function moveLeft()

{

numMoves++;

if(swapsComplete)

{

finalOrd.length=0;

}

​

temp=order[0];

for(var i=0; i<order.length-1; i++)

  {

  order[i]=order[i+1];

  }

  order[order.length-1]=temp;

}

​

function moveRight()

{

numMoves++;

if(swapsComplete)

{

finalOrd.length=0;

}

temp=order[order.length-1];

for(var i=order.length-1; i>0; i--)

  {

  order[i]=order[i-1];

  }

  order[0]=temp;

}

​

function swap()

{

numMoves++;

if(swapsComplete)

{

finalOrd.length=0;

}

temp=order[0];

order[0]= order[7];

order[7]=temp;

}

​

​

function mix()

{

finalOrd.length=0;

for(var i=0; i<1000; i++)

{

nextMove=floor(random(3));

​

switch(nextMove)

{

  case 0: moveLeft();

    break;

  case 1: moveRight();

      break;

  case 2: swap();

    break;

}

numMoves=0;  

}

}

​

// This function will output

// one move per call

function autoSolve()

{

var currentOrder=[];

var index1;

var highest=1;

var next;

var nextIndex;

​

// find index 1

for(var i=0; i<order.length; i++)

{

currentOrder.push(order[i]);

if(order[i]==1)

    {

    index1=i;

    }

}

​

// Reorder the current order with 1 at the front

​

var firstHalf=[];

var secondHalf=[];  

for(var i=0; i<index1; i++)

{

firstHalf.push(currentOrder[i]);

}

for(var i=index1; i<currentOrder.length; i++)

{

secondHalf.push(currentOrder[i]);  

}

currentOrder.length=0;

currentOrder=secondHalf.concat(firstHalf);

//console.log("Current Order: " + currentOrder);

​

​

// Find highest completed number

// and index of next target

highest=1;

look=true;        // Keep looking as long as they are

// in order

for(var i=0; i< currentOrder.length && look; i++)

{

if(currentOrder[i]+1==(currentOrder[i+1]))

    {

    highest=currentOrder[i]+1

    }

  else

  {

  look=false; 

  }

}

//console.log("HIGHEST: " + highest);

// At this point we know the highest number in order

// Now we will search for the next highest number

// and move that number toward index 1

​

next=highest+1;

​

  for(var i=0; i<order.length; i++)

  {

  if(order[i]==next)

  {

      nextIndex=i; 

  }

  }

​

var targetIndex=0;

if(next<=8)

{

if((index1-nextIndex == -11) || (index1-nextIndex==1) || (index1-nextIndex==2))

      {

      targetIndex=3;

      }

else

      {

      targetIndex=1;

      }

if(nextIndex==targetIndex)

{

swap(); 

}

else if(targetIndex==1)

    {

    if(nextIndex<=6 && nextIndex!=0)

          {

          moveLeft()

          }

      else

      {

      moveRight(); 

      }

    }

else if(targetIndex==3)

    {

    if(nextIndex<=9 && nextIndex>3)

          {

          moveLeft()

          }

      else

      {

      moveRight(); 

      }

    }

​

}

//Now that we have first 8 numbers in order, 

// we use the last 4 numbers to move 1 based off

// our lookup table. 

else

  {

  if(order[11]!=8)

    {

    while(order[11]!=8)

    {

    moveLeft();  

    }

    if(order[0]>order[1])

    {

    swap(); 

    }

    }

  var finalStr="";

  if(finalOrd.length==0)

  {

  for(var i=0; i<4; i++)

  {

  finalOrd.push(order[i]);

  //finalOrd=finalOrd+(order[i] * multiplier)

  }

  for(var i=0; i<finalOrd.length; i++)

  {

  finalStr+=str(finalOrd[i]);  

  }

  //console.log("Final Order: " + finalStr);

/*

9, 10, 12, 11 - 9

9, 11, 10, 12 - 1

9, 11, 12, 10 - 4

9, 12, 10, 11  - 6

9, 12, 11, 10  - 5

10, 11, 9, 12 - 6

10, 11, 12, 9 -  5

10, 12, 11, 9  -  4

10, 12, 9, 11 - 1

11, 12, 9, 10 - 1&1

11, 12, 10, 9 - 7

*/

var numSwaps=0;

    switch(finalStr)

    {

    case "9101211":

        numSwaps=9;

        break;

    case "9111012":

        numSwaps=1;

        break;

    case "9111210":

        numSwaps=4;

        break;

    case "9121011":

        numSwaps=6;

        break;

    case "9121110":

        numSwaps=5;

        break;

    case "1011912":

        numSwaps=6;

        break;

    case "1011129":

        numSwaps=5;

        break;

    case "1012119":

        numSwaps=4;

        break;

    case "1012911":

        numSwaps=1;

        break;

    case "1112910":

        numSwaps=9;

        break;

     case "1112109":

        numSwaps=7;

        break;

        default:

        if(numMoves!=8)

        {

        numSolves++;

        }

        totalMoves+=numMoves;

        avg=totalMoves/numSolves;

        mix();

    }

  //console.log(numSwaps);

  autoMode=false;

  moveLeft();

  for(var i=0; i<numSwaps; i++)

  {

  swap();

  moveRight();

  }

  autoMode=true;

  swapsComplete=true;

  }

  }

​

}

​