cs0x7f

package puzzle;

import java.util.Random;

public class SkewbSolver {


    private static final int[] fact = { 1, 1, 1, 3, 12, 60, 360 };//fact[x] = x!/2
    private static char[][] permmv = new char[4320][4];
    private static char[][] twstmv = new char[2187][4];

cs0x7f

var getgearoptscramble=(function() {
	var cmv = [];
	var emv = [];
	var prun = [];
	
	function cornerMove(idx, m) {
		var arr = [], temp;
		mathlib.setNPerm(arr, idx, 4);
		temp = arr[0];
		arr[0] = arr[m+1];

cs0x7f

/*

scramble_333.js

3x3x3 Solver / Scramble Generator in Javascript.

The core 3x3x3 code is from a min2phase solver by Shuang Chen.
Compiled to Javascript using GWT and j2js project.

new feature:

cs0x7f

function nullMethod(){
}

function FullCube_copy(obj, c){
  obj.ul = c.ul;
  obj.ur = c.ur;
  obj.dl = c.dl;
  obj.dr = c.dr;
  obj.ml = c.ml;

cs0x7f

center = [0]*360;
corner = [0]*8748;
centermv = [[0 for col in range(4)] for row in range(360)];
cornermv = [[0 for col in range(4)] for row in range(8748)];

def cycle3(arr, i1, i2, i3):
    c = arr[i1];
    arr[i1] = arr[i2];
    arr[i2] = arr[i3];
    arr[i3] = c;

cs0x7f

/*

scramble_333.js

3x3x3 Solver / Scramble Generator in Javascript.

The core 3x3x3 code is from a min2phase solver by Shuang Chen.
Compiled to Javascript using GWT.
(There may be a lot of redundant code right now, but it's still really fast.)