Assignment 1 Karel the Robot

Assignment 1 Karel the Robot

背景介绍
Karel 是一个机器人,具有的功能有
move(),turnLeft(),putBeeper(),pickBeeper()等功能。

Karel的升级版SuperKarel具有的功能有frontIsClear(),leftIsClear(),rightIsClear(),beepersPresent(),beepersInBag(),facingNorth(),facingSouth(),facingEast(),facingwest()等功能

题目1:

Your first task is to solve a simple story-problem in Karel’s world. Suppose that Karel
has settled into its house, which is the square area in the center of the following diagram:



Karel starts off in the northwest corner of its house as shown in the diagram. The problem
you need to get Karel to solve is to collect the newspaper—represented (as all objects in
Karel’s world are) by a beeper—from outside the doorway and then to return to its initial
position.

This exercise is extremely simple and exists just to get you started. You can assume that
every part of the world looks just as it does in the diagram. The house is exactly this size,
the door is always in the position shown, and the beeper is just outside the door. Thus, all
you have to do is write the sequen ce of commands necessary to have Karel

  1. Move to the newspaper,
  2. Pick it up, and
  3. Return to its starting point.

Even though the program is only a few lines, it is still worth getting at least a little
practice in decomposition. In your solution, include a private method for each of the
steps shown in the outline.

题目2

Karel has been hired to repair the damag e done to the Quad in the 1989 earthquake. In
particular, Karel is to repair a set of arches where some of the stones (represented by
beepers, of course) are missing from the columns supporting the arches, as follows:



Your program should work on the world shown above, but it shoul d be general enough to
handle any world that meets certa in basic conditions as outlined at the end of this
problem. There are several example worlds in the starter folder, and your program should
work correctly with all of them.

When Karel is done, the missing stones in the columns should be replaced by beepers, so
that the final picture resulting from the world shown above would look like this:



Karel may count on the following facts about the world, list on the next page:

  • Karel starts at 1st Avenue and 1st Stre et, facing east, with an infinite number of
    beepers.
  • The columns are exactly four units apart, on 1st, 5th, 9th Avenue, and so forth.
    +The end of the columns is marked by a wall immediately after the final column. This
    wall section appears a fter 13th Avenue in the example, but your program should work
    for any number of columns.
  • The top of the column is mar ked by a wall, but Karel cannot assume that columns are
    always five units high, or even that all columns are the same height.
  • Some of the corners in the column may already contain beepers representing stones
    that are still in place. Your program should not put a second beeper on these corners.

题目3

In this exercise, your job is to get Karel to crea te a checkerboard pattern of beepers inside
an empty rectangular world, as illustrated in the following before-a nd-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 8 x 8 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 c ontains several sample worlds that test these
special cases, and you should make sure that your program works for each of them.

题目4

As an exercise in solving algorithmic problems, program Karel to place a single beeper at
the center of 1st Street. For example, if Karel starts in the world



it should end with Karel standing on a beeper in the following position:



Note that the final configuration of the world should have only a single beeper at the
midpoint of 1st Street. Along the way, Karel is allowed to place additional beepers
wherever it wants to, but must pick them all up again before it finishes.

In solving this problem, you may count on the following facts about the world:

  • Karel starts at 1st Avenue and 1st Stre et, facing east, with an infinite number of
    beepers in its bag.
  • The initial state of the world in cludes no interior walls or beepers.
  • The world need not be square, but you may assume that it is at least as tall as it is wide.

Your program, moreover, can assume the following simplifications:

  • If the width of the world is odd, Karel must put the beeper in the center square. If the
    width is even, Karel may drop the beeper on either of the two center squares.
  • It does not matter which direction Karel is facing at the end of the run.

There are many different algorithms you can use to solve this problem. The interesting
part of this assignment is to come up with a strategy that works.

问题解答

CollectNewspaperKarel.java

import stanford.karel.*;
    
public class CollectNewspaperKarel extends SuperKarel {
    public void run() {
        move();
        move();
        turnRight();
        move();
        turnLeft();
        move();
        pickBeeper();
        turnLeft();
        turnLeft();
        move();
        move();
        move();
        turnRight();
        move();
        turnRight();
    }
}

StoneMasonKarel.java

    import stanford.karel.*;

    public class StoneMasonKarel extends SuperKarel {
    
        public void run() {
            turnLeft();
            while(true){//之前写的while(frontIsClear())在column长度为1时会出现错误
                fixLine();
            }
        }
        
        private void fixLine() {
            while(frontIsClear()){
                if(noBeepersPresent()) {
                    putBeeper();
                }
                move();
            }       
            if(facingNorth()) {
                turnRight();
                if(noBeepersPresent()) {
                    putBeeper();
                }
                if(frontIsClear()) {
                    move4Steps();
                    turnLeft();
                    while(frontIsClear()) {
                        move();
                    }
                    turnRight();
                    turnRight();
                }
            }else if (facingSouth()){
                    turnLeft();
                    if(noBeepersPresent()) {
                        putBeeper();
                    }
                    if(frontIsClear()) {
                        move4Steps();
                        turnRight();
                        while(frontIsClear()) {
                            move();
                        }
                            turnLeft();
                            turnLeft(); 
                    }
                }
        }
        
        private void move4Steps() {
            move();
            move();
            move();
            move();
        }
     }

CheckerboardKarel.java

    import stanford.karel.*;
    
    public class CheckerboardKarel extends SuperKarel {
        public void run() {
            while(frontIsClear()) {
                while(frontIsClear()) {
                    putBeeper();
                    if(beepersPresent()) {
                        move();
                    } 
                    if(frontIsClear()){
                        move();
                    }
                }
                if(facingEast()) {
                    if(leftIsClear()){
                        turnLeft();
                        if(frontIsClear()) {
                            move();
                        }
                            turnLeft();
                    }
                }else{
                    if(rightIsClear()){
                        turnRight();
                        if(frontIsClear()) {
                            move();
                        }
                        turnRight();
                    }   
                }
            }
            if(facingEast()) {
                turnLeft();
                while(frontIsClear()) {
                    putBeeper();
                    if(beepersPresent()) {
                        move();
                    } 
                    if(frontIsClear()){
                        move();
                    }
                }
            }
                else{turnRight();
                    while(frontIsClear()) {
                        putBeeper();
                        if(beepersPresent()) {
                            move();
                        } 
                        if(frontIsClear()){
                            move();
                        }   
                    }
                }
                    if(noBeepersPresent()){
                        moveBack();
                        if(beepersPresent()) {
                            moveBack();
                        }else{
                            moveBack();
                            putBeeper();
                            }
                        }
                    }
        private void moveBack() {
            turnAround();
            move();
            }
        }
最后编辑于
©著作权归作者所有,转载或内容合作请联系作者
  • 序言:七十年代末,一起剥皮案震惊了整个滨河市,随后出现的几起案子,更是在滨河造成了极大的恐慌,老刑警刘岩,带你破解...
    沈念sama阅读 151,688评论 1 330
  • 序言:滨河连续发生了三起死亡事件,死亡现场离奇诡异,居然都是意外死亡,警方通过查阅死者的电脑和手机,发现死者居然都...
    沈念sama阅读 64,559评论 1 273
  • 文/潘晓璐 我一进店门,熙熙楼的掌柜王于贵愁眉苦脸地迎上来,“玉大人,你说我怎么就摊上这事。” “怎么了?”我有些...
    开封第一讲书人阅读 101,749评论 0 226
  • 文/不坏的土叔 我叫张陵,是天一观的道长。 经常有香客问我,道长,这世上最难降的妖魔是什么? 我笑而不...
    开封第一讲书人阅读 42,581评论 0 191
  • 正文 为了忘掉前任,我火速办了婚礼,结果婚礼上,老公的妹妹穿的比我还像新娘。我一直安慰自己,他们只是感情好,可当我...
    茶点故事阅读 50,741评论 3 271
  • 文/花漫 我一把揭开白布。 她就那样静静地躺着,像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上,一...
    开封第一讲书人阅读 39,684评论 1 192
  • 那天,我揣着相机与录音,去河边找鬼。 笑死,一个胖子当着我的面吹牛,可吹牛的内容都是我干的。 我是一名探鬼主播,决...
    沈念sama阅读 31,122评论 2 292
  • 文/苍兰香墨 我猛地睁开眼,长吁一口气:“原来是场噩梦啊……” “哼!你这毒妇竟也来了?” 一声冷哼从身侧响起,我...
    开封第一讲书人阅读 29,847评论 0 182
  • 序言:老挝万荣一对情侣失踪,失踪者是张志新(化名)和其女友刘颖,没想到半个月后,有当地人在树林里发现了一具尸体,经...
    沈念sama阅读 33,441评论 0 228
  • 正文 独居荒郊野岭守林人离奇死亡,尸身上长有42处带血的脓包…… 初始之章·张勋 以下内容为张勋视角 年9月15日...
    茶点故事阅读 29,939评论 2 232
  • 正文 我和宋清朗相恋三年,在试婚纱的时候发现自己被绿了。 大学时的朋友给我发了我未婚夫和他白月光在一起吃饭的照片。...
    茶点故事阅读 31,333评论 1 242
  • 序言:一个原本活蹦乱跳的男人离奇死亡,死状恐怖,灵堂内的尸体忽然破棺而出,到底是诈尸还是另有隐情,我是刑警宁泽,带...
    沈念sama阅读 27,783评论 2 236
  • 正文 年R本政府宣布,位于F岛的核电站,受9级特大地震影响,放射性物质发生泄漏。R本人自食恶果不足惜,却给世界环境...
    茶点故事阅读 32,275评论 3 220
  • 文/蒙蒙 一、第九天 我趴在偏房一处隐蔽的房顶上张望。 院中可真热闹,春花似锦、人声如沸。这庄子的主人今日做“春日...
    开封第一讲书人阅读 25,830评论 0 8
  • 文/苍兰香墨 我抬头看了看天上的太阳。三九已至,却和暖如春,着一层夹袄步出监牢的瞬间,已是汗流浃背。 一阵脚步声响...
    开封第一讲书人阅读 26,444评论 0 180
  • 我被黑心中介骗来泰国打工, 没想到刚下飞机就差点儿被人妖公主榨干…… 1. 我叫王不留,地道东北人。 一个月前我还...
    沈念sama阅读 34,553评论 2 249
  • 正文 我出身青楼,却偏偏与公主长得像,于是被迫代替她去往敌国和亲。 传闻我的和亲对象是个残疾皇子,可洞房花烛夜当晚...
    茶点故事阅读 34,618评论 2 249

推荐阅读更多精彩内容