21-Jul-2020 14:30:34

polyomino_parity_test:
  MATLAB/Octave version 4.2.2
  Test polyomino_parity().

addmultisteps_test:
  MATLAB/Octave version 4.2.2
  [ num, no_sums, s ] = addmultisteps ( p, ns, steps )
  input:
    P is the parity of the region.
    NS is a vector of step counts.
    STEPS is a vector of step sizes.
  output:
    NUM is the number of sums equal to P.
    NO_SUMS is the number of sums generated.
    S, contains every sum computed.

  For this example:
    P = 0
    NS = [ 2, 5, 3, 6, 7 ]
    STEPS = [ 1, 3, 2, 5, 9 ]

  56 sums equal to P were found:
  Correct number of such sums is 56
  4032 sums were generated:

  For this example:
    P = 4
    NS = [ 1, 1, 3 ]
    STEPS = [ 1, 3, 4 ]

  0 sums equal to P were found:
  Correct number of such sums is 0
  16 sums were generated:

  For this example:
    P = 4
    NS = [ 3, 1, 1 ]
    STEPS = [ 1, 3, 4 ]

  2 sums equal to P were found:
  Correct number of such sums is 2
  16 sums were generated:

pv_search_test
  MATLAB/Octave version 4.2.2
  pv_search() applies parity arguments to potential
  solutions of a polyomino tiling problem.

  Example 6
  parities = [ 0, 1 ]
  orders = [ 4, 3 ]
  p = 9
  c = 41

  2 trivial parity violations were found:

  1: [ 5, 7 ]
  2: [ 8, 3 ]

  0 strong parity violations were found:

  Example 8
  parities = [ 0, 2, 3, 5 ]
  orders = [ 2, 4, 5, 9 ]
  p = 0
  c = 156

  0 trivial parity violations were found:

  15 strong parity violations were found:

  1: [ 4, 2, 1, 15 ]
  2: [ 8, 1, 2, 14 ]
  3: [ 13, 2, 1, 13 ]
  4: [ 17, 1, 2, 12 ]
  5: [ 22, 2, 1, 11 ]
  6: [ 26, 1, 2, 10 ]
  7: [ 31, 2, 1, 9 ]
  8: [ 35, 1, 2, 8 ]
  9: [ 40, 2, 1, 7 ]
  10: [ 44, 1, 2, 6 ]
  11: [ 49, 2, 1, 5 ]
  12: [ 53, 1, 2, 4 ]
  13: [ 58, 2, 1, 3 ]
  14: [ 62, 1, 2, 2 ]
  15: [ 67, 2, 1, 1 ]

  Example 9
  parities = [ 0, 1, 2, 5 ]
  orders = [ 4, 3, 6, 13 ]
  p = 0
  c = 320

  0 trivial parity violations were found:

  6 strong parity violations were found:

  1: [ 3, 1, 1, 23 ]
  2: [ 16, 1, 1, 19 ]
  3: [ 29, 1, 1, 15 ]
  4: [ 42, 1, 1, 11 ]
  5: [ 55, 1, 1, 7 ]
  6: [ 68, 1, 1, 3 ]

pv_search_test:
  Normal end of execution.

sumallsteps_test:
  MATLAB/Octave version 4.2.2
  sumallsteps() finds all possible sums, of the form
    S = Ai + N * ( +/- Q )
  where:
    Ai is any single entry of the vector A
    N counts the number of +/- Q values to be added.
    Q is the magnitude of the increments or steps.

  For this example:
    A = [ 1, 2 ]
    N = 8
    Q = 2

  18 distinct sums were found:

   1: -15
   2: -14
   3: -11
   4: -10
   5:  -7
   6:  -6
   7:  -3
   8:  -2
   9:   1
  10:   2
  11:   5
  12:   6
  13:   9
  14:  10
  15:  13
  16:  14
  17:  17
  18:  18

polyomino_parity_test:
  Normal end of execution.

21-Jul-2020 14:37:06