As I mentioned earlier, a new fractal/random cutting engine is under development.  The goal of the new engine is to be quicker and easier to implement, more flexible, and more powerful than the Fraccut engine (the original cutting engine).  This new engine will be called XenCut.

XenCut went through some preliminary tests tonight and is already performing well.  Since it's based on the OS data framework, the code looks very readable and runs fast.  But the real power of the engine is in the new cutting methods.  The engine now has three cutting "modes": linear factor, divisor, and offset.  The linear factor simply takes the cutting parameters to be coefficients (multipliers) of the original block widths.  The divisor mode does the same but with the reciprocal of the parameters (i.e. division).  Finally, the last mode, which is already coming in very handy for CrystalNet, simply takes the parameters to be offsets (constant factors).  The third mode helps to avoid strange durations and still find valid cuts when the original block widths don't fall within the typical power-of-two ranges.

I expect XenCut to find application in many more modules, and I hope it will provide a valuable source of fractal building blocks for future modules.  CrystalNet will be the first module to make use of the XenCut engine.  Given that I've found no other adequate way to do random structures, XenCut will really prove itself if it can power a working structure generator - that is, if CrystalNet comes through.