Hi All, I'm writing to propose a new official web-based scrambler for 3x3x3. Jeremy Fleischman and myself have been working with the Herbert Kociemba's Java implementation of the two-phase algorithm to make random-state scrambles available via the web. A working example of this has been implemented into cTimer (http://www.ctimer.co.uk) and has been tested on multiple platforms including: Windows (IE6+, Firefox, Chrome), Mac(Safari) and Linux(Firefox, Chrome). The benefit of a web-based scrambler implemented as a Java applet is that it is platform independent, so makes random-state scrambles available to all. With this in mind we thought it would be a good idea to offer a web-based option for WCA scrambles. To this end I modified Jaap's original N-dimensional WCA JavaScript scrambler to retrieve scrambles by making JavaScript calls to the applet-based Java implementation of Herbert's two-phase algorithm. Just for demonstration purposes I've made the scrambler available here: http://cube.crider.co.uk/wca_scrambler/ ... be_333.htm ... the source code for the applet generating the scrambles is available here: http://cube.crider.co.uk/wca_scrambler/ ... er_src.zip .. please note, the lookup tables are saved statically within the jar file, so the initial page load requires a ~2MB download. Because the browser cache normally saves the jar file, subsequent re-loads are much faster. .. note also that in order to run the application requires the the Sun Java plugin to be installed in the browser. If you have a Java plugin installed, but it doesn't seem to work, check that Sun is the plugin vendor. The original Java implementation of the random-state scrambler had some shortcomings with the pseudorandom number generator. Because its state space is something of the order of 2^48, it is not able to capture every possible cube state. This issue has been addressed in the new version by using the Mersenne Twister generator which has a period of 2^19937 − 1 (more than enough to capture every possible cube state). More discussion on this issue can be found here: http://games.groups.yahoo.com/group/spe ... ded=1&p=19 http://www.speedsolving.com/forum/showt ... post346833 ... and the source for the pseudorandom generator used is here: http://www.math.sci.hiroshima-u.ac.jp/~ ... andom.java http://goui.net/doc/net/goui/util/MTRandom.html The main benefits of using this scrambler are that it is accessible on all platforms, (conveniently via the web) and that the source code for the scramble generator and solver is freely available, making it transparent and open to scrutiny. Finally, I would like to point out that this scrambler was only made possible with the combined effort of a number of talented developers. A big thanks goes to: Herbert Kociemba for his Java implementation of the two-phase algorithm, Jaap Scherphuis for his javascript front-end, Jeremy Fleischman for his work on static lookup tables in the Java wrapper, and finally David Beaumont for his LGPL Java implementation of the Mersenne Twister algorithm. EDIT: Discussion about it on speedsolving.com here: http://www.speedsolving.com/forum/showt ... hp?t=21153