code: /*
   * Copyright (c) 2018, The Regents of the University of California
   *
   * All rights reserved.
   *
   * Redistribution and use in source and binary forms, with or without
   * modification, are permitted provided that the following conditions are
   * met:
   *
   * 1. Redistributions of source code must retain the above copyright
   * notice, this list of conditions and the following disclaimer.
   *
   * 2. Redistributions in binary form must reproduce the above copyright
   * notice, this list of conditions and the following disclaimer in the
   * documentation and/or other materials provided with the distribution.
   *
   * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
   * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
   * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
   * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
   * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
   * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
   * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
   * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
   * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
   * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
   * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
   */
  package edu.berkeley.cs.jqf.examples.chess;
  
  import chess.Move;
  import chess.Situation;
  import chess.variant.Standard$;
  import com.pholser.junit.quickcheck.generator.InRange;
  import com.pholser.junit.quickcheck.generator.Size;
  import edu.berkeley.cs.jqf.fuzz.Fuzz;
  import edu.berkeley.cs.jqf.fuzz.JQF;
  import org.junit.runner.RunWith;
  import scala.collection.IndexedSeq;
  
  /**
   * @author Rohan Padhye
   */
  @RunWith(JQF.class)
  public class MoveTest {
  
      private Situation initial = Situation.apply(Standard$.MODULE$);
  
      @Fuzz
      public void tryMoves(@InRange(minInt=0) int @Size(min=1, max=20)[] choices) {
          Situation state = initial;
          Move lastMove = null;
          for (int i = 0; i < choices.length; i++) {
              IndexedSeq<Move> moves = state.moves().values().flatten((x) -> x).toIndexedSeq();
              int k = choices[i] % moves.size();
              lastMove = moves.apply(k);
              state = lastMove.situationAfter();
              //System.out.print(Dumper.apply(lastMove));
              //System.out.print(" ");
          }
          //System.out.println();
      }
  
  }
  