else:
r = [ ]
for kernel_size in range(1, input_size + 1):
- for stride in range(1, input_size + 1):
+ for stride in range(1, input_size):
if cond(depth, kernel_size, stride):
n = (input_size - kernel_size) // stride + 1
- if (n - 1) * stride + kernel_size == input_size:
+ if n >= output_size and (n - 1) * stride + kernel_size == input_size:
q = conv_chain(n, output_size, depth - 1, cond)
r += [ [ (kernel_size, stride) ] + u for u in q ]
return r