James33

Members
  • Content count

    38
  • Joined

  • Last visited

Community Reputation

1

About James33

  • Rank
    Junior Member
  1. I think the answer will be the same as the maximum.
  2. True, I was just giving an outline of what I would do because I don't think it is what the OP as it has no upper bound on time taken.
  3. I don't think that the logic there quite works. Certain results could be ignored (conditional on what has been generated) to make everything divisible by 3.
  4. By not run forever, do you mean that we must be able to fix a time at which the algorithm will certainly have terminated by? If you mean that it just has to end at some point then
  5. What shape is the moat? Does it have to be a straight line? Can it vary in width? If it can be any shape, just choose a moat in the shape of a very pointy arrow and cross over at the point using 1 board.
  6. What are we supposed to do? Or is that part of the problem? My guess is 3.
  7. I'm tired so my reasoning is probably flawed:
  8. Just visualising it, won't there be multiple valid answers?