/* File LeapfrogState.m This is the state used for leapfrog search. When backjumping past a square, the square remembers its current value and tries that value first the next time through. */ #import #import "Leapfrog.h" /* 行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行 */ @implementation LeapfrogState - squareClass { return [LeapfrogSquare class]; } - wordClass { return [LeapfrogWord class]; } /* 行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行 */ @end