test.java

import java.util.Random;
import java.io.*;
import cs.min2phase.Tools;
import cs.min2phase.Search;

public class test {

	static int[] fact = {1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800, 39916800, 479001600};

	static void set8Perm(byte[] arr, int idx) {
		int val = 0x76543210;
		for (int i=0; i<7; i++) {
			int p = fact[7-i];
			int v = idx / p;
			idx -= v*p;
			v <<= 2;
			arr[i] = (byte) ((val >> v) & 0xf);
			int m = (1 << v) - 1;
			val = (val & m) + ((val >> 4) & ~m);
		}
		arr[7] = (byte)val;
	}


	static int get8Perm(byte[] arr) {
		int idx = arr[0];
		int val = 0x76543210 - (0x11111110 << (idx << 2));
		for (int i=1; i<7; i++) {
			int v = arr[i] << 2;
			val -= 0x11111110 << v;
			idx = (8 - i) * idx + ((val >> v) & 0xf);
		}
		return idx;
	}

	static void set8PermX(byte[] arr, int idx) {
		int val = 0x76543210;
		for (int i=8; i>1; i--) {
			int v = (idx % i) << 2;
			idx /= i;
			arr[8-i] = (byte) ((val >> v) & 0xf);
			int m = (1 << v) - 1;
			val = (val & m) + ((val >> 4) & ~m);
		}
		arr[7] = (byte)val;
	}

	static int get8PermX(byte[] arr) {
		int idx = 0;
		int val = 0x11111110 << (arr[7] << 2);
		for (int i=6; i>=0; i--) {
			int v = arr[i] << 2;
			idx = (8 - i) * idx + ((val >> v) & 0xf);
			val += 0x11111110 << v;
		}
		return idx;
	}
	
	static void other() {
		for (int ix=0; ix<100; ix++) {
			byte[] cp = {0, 1, 2, 3, 4, 5, 6, 7};
			byte[] co = {0, 0, 0, 0, 0, 0, 0, 0};
			byte[] ep = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10,11};
			byte[] eo = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
		
//			Tools.randomState(cp, co, ep, eo);

			for (int i=0; i<8; ++i) {
				System.out.print(String.format("%2s", cp[i]));
			}
			System.out.print("\t");
			for (int i=0; i<8; ++i) {
				System.out.print(String.format("%2s", co[i]));
			}
			System.out.print("\t");
			for (int i=0; i<12; ++i) {
				System.out.print(String.format("%3s", ep[i]));
			}
			System.out.print("\t");
			for (int i=0; i<12; ++i) {
				System.out.print(String.format("%2s", eo[i]));
			}
			System.out.println();
		}
	}

	public static void main(String[] args) {
		if (args.length == 0) {
			System.out.println("java -client test testValue [nSolves maxLength maxTime minTime verbose]");
			return;
		}
		int testValue = args.length < 1 ? 0 : Integer.parseInt(args[0]);
		int nSolves = args.length < 2 ? 1000 : Integer.parseInt(args[1]);
		int maxLength = args.length < 3 ? 21 : Integer.parseInt(args[2]);
		int maxTime = args.length < 4 ? 100000 : Integer.parseInt(args[3]);
		int minTime = args.length < 5 ? 0 : Integer.parseInt(args[4]);
		int verbose = args.length < 6 ? 0 : Integer.parseInt(args[5]);
		
		long tm;
		if ((testValue & 0x01) != 0) {
			tm = System.nanoTime();
			other();
			System.out.println(System.nanoTime()-tm);
		}

		DataInputStream dis = null;
		if ((testValue & 0x02) != 0) {
			tm = System.nanoTime();
			try {
				dis = new DataInputStream(new BufferedInputStream(new FileInputStream("data")));
				Tools.initFrom(dis);
			} catch (Exception e) {
				dis = null;
				e.printStackTrace();
			}
			System.out.println(System.nanoTime()-tm);
		}
		if ((testValue & 0x04) != 0) {
			tm = System.nanoTime();
			if (dis == null) {
				DataOutputStream dos = null;
				try {
					dos = new DataOutputStream(new BufferedOutputStream(new FileOutputStream("data")));
					Tools.saveTo(dos);
					dos.close();
				} catch (Exception e) {
					e.printStackTrace();
				}
			}
			System.out.println(System.nanoTime()-tm);
		}

		tm = System.nanoTime();
		Tools.init();
		if ((testValue & 0x08) != 0) {
			System.out.println(System.nanoTime()-tm);
		}

		Search search = new Search();
		if ((testValue & 0x10) != 0) {
			tm = System.nanoTime();
			System.out.println(search.solution(Tools.superFlip(), 22, 100000, 10, 7));
			System.out.println(System.nanoTime()-tm);
		}
		
		if ((testValue & 0x20) != 0) {
			tm = System.nanoTime();
			int total = 0;
			int x = 0;
//			System.out.print("Average Solving Time: - nanoSecond(s)\r");
			long minT = 1L << 62;
			long maxT = 0L;
			long totalTime = 0;
			while (System.nanoTime() - tm < 60000000000L && x < nSolves) {
				long curTime = System.nanoTime();
				String cube = Tools.randomCube();
				String s = search.solution(cube, maxLength, maxTime, minTime, verbose);
				curTime = System.nanoTime() - curTime;
				totalTime += curTime;
				maxT = Math.max(maxT, curTime);
				minT = Math.min(minT, curTime);
//				System.out.println(s);
				x++;
				System.out.print(String.format("AvgTime: %8.3f ms, MaxTime: %8.3f ms, MinTime: %8.3f ms\r", 
					(totalTime/1000000d)/x, maxT/1000000d, minT/1000000d));
			}
			System.out.println();
			System.out.println(x + " Random Cube(s) Solved");
			System.out.println(
				"MaxLength: " + maxLength + "\n" + 
				"MaxTimeLimited: " + maxTime + "\n" + 
				"MinTimeLimited: " + minTime + "\n" + 
				"verbose: " + verbose);
		}
	}
}