ch.randelshofer.rubik.solver
Class Main

java.lang.Object
  ch.randelshofer.rubik.solver.Main

public class Main
extends java.lang.Object

Main class of the solver. Use this class to invoke the solver from the command line.

Version:

0.0 2000-07-02 Created.

Author:

Werner Randelshofer, Hausmatt 10, CH-6405 Immensee, Switzerland

Constructor Summary

Main()

Method Summary

static void	main(java.lang.String[] args) Command line format:
static void	startBatch(java.lang.String[] args)
static void	startGUI()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Main

public Main()

Method Detail

main

public static void main(java.lang.String[] args)

Command line format:

>java ch.randelshofer.rubik.solver.Main FaceSpecifier1 FaceSpecifier2 ... FaceSpecifier6

where each face specifier is of the form f:mmmmmmmmm

and f (face) must be one of {U,D,F,B,L,R} and m (marker) can be any printable ASCII character. Grasp the left or right side of the cube with one hand and rotate it so that the face under consideration is in front of you. The order of the markers is left-to-right, top-to-bottom with respect to each face. For example, consider the following "unfolded" cube:

              Red Red Wht
              Yel Wht Wht
              Wht Red Red

 Wht Wht Grn  Org Yel Yel  Blu Red Org  Yel Grn Grn
 Red Org Org  Yel Yel Yel  Blu Red Org  Blu Grn Blu
 Yel Wht Grn  Org Wht Org  Yel Blu Blu  Red Grn Red

              Blu Org Blu
              Grn Blu Grn
              Wht Org Grn
 

With the faces above corresponding to:

      Up
 Left Front Right Back
      Down
 

Then one possible way to enter this configuration is:

>java ch.randelshofer.rubik.solver.Main L:WWGROOYWG R:BROBROYBB U:RRWYWWWRR D:BOBGBGWOG F:OYYYYYOWO B:YGGBGBRGR

Note: that the choice of marker characters is completely arbitrary, one must only use them consistently within any given cube configuration specification. Also, the order of each face specification is arbitrary.

When run, the program will first load the move mapping and pruning tables (it will regenerate them if not found) then perform the search. Successively shorter solutions will be printed out until an optimal solution is found (that may take a very long time) and the program terminates, or the program is aborted by the user.

startBatch

public static void startBatch(java.lang.String[] args)

startGUI

public static void startGUI()