It must work for any size world (e.g., 5x5, 8x8, or even a 1x1).
Remember that for a row of length 5, there are 4 moves but 5 potential beeper spots. Your code must account for that final spot. Conclusion 645 checkerboard karel answer verified
This solution is robust because it uses and Post-conditions . It must work for any size world (e
Karel needs to move across the street, putting down beepers at every other spot. 645 checkerboard karel answer verified
Trebuie să fii autentificat pentru a publica un comentariu.