斯坦福大学开放课程——编程方法 作业1-3

Problem 3
In this exercise, your job is to get Karel to create a checkerboard pattern of beepers inside an empty rectangular world, as illustrated in the following before-and-after diagram:

This problem has a nice decomposition structure along with some interesting algorithmic issues. As you think about how you will solve the problem, you should make sure that your solution works with checkerboards that are different in size from the standard 8x8 checkerboard shown in the example. Odd-sized checkerboards are tricky, and you should make sure that your program generates the following pattern in a 5x3 world:

 

 Another special case you need to consider is  that of a world which is only one column wide or one row high.  The starter folder contains several sample worlds that test these special cases, and you should make sure that your program works for each of them.

 

程序源代码：

/* * File: CheckerboardKarel.java * ---------------------------- * When you finish writing it, the CheckerboardKarel class should draw * a checkerboard using beepers, as described in Assignment 1. You * should make sure that your program works for all of the sample * worlds supplied in the starter folder. */ import stanford.karel.*; public class CheckerboardKarel extends SuperKarel { public void run(){ int num=0; putBeeper(); while(true){ num = checkerRow(num); turnLeft(); num = repositionForRow(num); if(0 == num) break; turnLeft(); num = checkerRow(num); turnRight(); num = repositionForRow(num); if(0 == num) break; turnRight(); } } /* 在一行内按照要求放置Beeper并返回节点号数 */ private int checkerRow(int num) { while(frontIsClear()){ move(); num++; if(num%2==0){ putBeeper(); } } return num; } /* 转向前进情况的处理，返回节点号数，0表示已全部完成 */ private int repositionForRow(int num){ if(frontIsClear()){ move(); num++; if(num%2==0){ putBeeper(); } } else{ num = 0; } return num; } }

---

结果演视频地址示： http://v.youku.com/v_show/id_XMjI5NTUyODQ0.html