Presentation is loading. Please wait.

Presentation is loading. Please wait.

Greeps A programming Competition. Greeps Description Greeps Scenario (a.zip file) Project 1: modify the Greeps class to increase your score in the competition.

Published byBrendan Bates Modified over 9 years ago

Similar presentations

Presentation on theme: "Greeps A programming Competition. Greeps Description Greeps Scenario (a.zip file) Project 1: modify the Greeps class to increase your score in the competition."— Presentation transcript:

1 Greeps A programming Competition

2 Greeps Description Greeps Scenario (a.zip file) Project 1: modify the Greeps class to increase your score in the competition Project 1 On-line hint Greeps.java

3 Methods Provided Greep class act() checkFoodcheckFood() getAuthorNamegetAuthorName() Actor class getIntersectingObjects (java.lang.Class cls) getOneIntersectingObject (java.lang.Class cls) getRotationgetRotation() getWorldgetWorld() getXgetX() getYgetY() setLocationsetLocation(int x, int y) setRotationsetRotation(int rotation … atShipatShip() atWateratWater() atWorldEdgeatWorldEdge() carryingTomatocarryingTomato() dropTomatodropTomato() getFlaggetFlag(int flagNo) getMemorygetMemory() loadTomatoloadTomato() movemove() randomChancerandomChance(int percent) removeTomatoremoveTomato() seePaintseePaint(java.lang.String color) setFlagsetFlag(int flagNo, boolean val) setMemorysetMemory(int val) spitspit(java.lang.String color) turnturn(int angle) turnHometurnHome() Creature class

4 Turning public void act () { turn (5); }

5 Where the action is: act () Current plan if (carryingTomato()) { if(atShip()) { dropTomato(); } else { turnHome(); move(); } else { move(); checkFood(); } Possible problems reaching the world boundary reaching water Possible changes if(atWater() || atWorldEdge()) { turn (????); }

6 Possible States and Strategies With Respect to the Tomatoes 1)Holding a tomato Go home (and leave a trail?) 2)Not holding nor near a tomato Search for tomatoes (follow a trail?) 3)At a pile of tomatoes Wait there until they are gone? With Respect to obstacles/location 1)At water’s edge Turn? Move? Leave a trail? Follow a trail? 2) At world’s edge Turn? Move? Leave a trail? Follow a trail? 3)At ship (after dropping tomatoes) Turn? Move? Leave a trail? Follow a trail?

7 What To Do 1.Devise a strategy – What to do in each state – How to use “spit” (3 colors) – How to use memory (1 int variable) 2.Implement your strategy as a program – Be prepared to make changes – Report your progress 3.Test and refine your program – Turn in final program Due Today Due Next Class Due Next Tuesday @ midnight

8 Example Error Messages 1.‘;’ expected 2.cannot find symbol - method Move() 3.turn(int) in Creature cannot be applied to (int,int) 4.turn(int) in Creature cannot be applied to (double) 5.act() in Greep cannot override act() in Creature; attempting to use incompatible return type

Download ppt "Greeps A programming Competition. Greeps Description Greeps Scenario (a.zip file) Project 1: modify the Greeps class to increase your score in the competition."

Similar presentations

Operating Systems Part III: Process Management (Process Synchronization)

Operating Systems Part III: Process Management (Process Synchronization)
This lecture is a bit of a departure in that we’ll cover how C++’s features are actually implemented. This implementation will look suspiciously similar.

This lecture is a bit of a departure in that we’ll cover how C++’s features are actually implemented. This implementation will look suspiciously similar.
PLDI’2005Page 1June 2005 Example (C code) int double(int x) { return 2 * x; } void test_me(int x, int y) { int z = double(x); if (z==y) { if (y == x+10)

PLDI’2005Page 1June 2005 Example (C code) int double(int x) { return 2 * x; } void test_me(int x, int y) { int z = double(x); if (z==y) { if (y == x+10)
Public class ABC { private int information = 0; private char moreInformation = ‘ ‘; public ABC ( int newInfo, char moreNewInfo) { } public ABC () {} public.

Public class ABC { private int information = 0; private char moreInformation = ‘ ‘; public ABC ( int newInfo, char moreNewInfo) { } public ABC () {} public.
METHOD OVERRIDING 1.Sub class can override the methods defined by the super class. 2.Overridden Methods in the sub classes should have same name, same.

METHOD OVERRIDING 1.Sub class can override the methods defined by the super class. 2.Overridden Methods in the sub classes should have same name, same.
Process Synchronization. Module 6: Process Synchronization Background The Critical-Section Problem Peterson’s Solution Synchronization Hardware Semaphores.

Process Synchronization. Module 6: Process Synchronization Background The Critical-Section Problem Peterson’s Solution Synchronization Hardware Semaphores.
Chapter 7 User-Defined Methods. Chapter Objectives  Understand how methods are used in Java programming  Learn about standard (predefined) methods and.

Chapter 7 User-Defined Methods. Chapter Objectives  Understand how methods are used in Java programming  Learn about standard (predefined) methods and.
Chapter 2 - The First Program: Little Crab

Chapter 2 - The First Program: Little Crab
Program: Little Crab Mr Gano.

Program: Little Crab Mr Gano.
Inheritance The objectives of this chapter are: To explore the concept and implications of inheritance Polymorphism To define the syntax of inheritance.

Inheritance The objectives of this chapter are: To explore the concept and implications of inheritance Polymorphism To define the syntax of inheritance.
Starting Out with C++: Early Objects 5/e © 2006 Pearson Education. All Rights Reserved Starting Out with C++: Early Objects 5 th Edition Chapter 6 Functions.

Starting Out with C++: Early Objects 5/e © 2006 Pearson Education. All Rights Reserved Starting Out with C++: Early Objects 5 th Edition Chapter 6 Functions.
Searching. 2 Searching an array of integers If an array is not sorted, there is no better algorithm than linear search for finding an element in it static.

Searching. 2 Searching an array of integers If an array is not sorted, there is no better algorithm than linear search for finding an element in it static.
Final and Static Keywords. Creating constants  There will be occasions where data items in a program have values that do not change.  Maximum score.

Final and Static Keywords. Creating constants  There will be occasions where data items in a program have values that do not change.  Maximum score.
EXERCISE IN CLASS CHAPTER 3. PART 1 IDENTIFIER SCENARIO 1 o record1 o 1record o file_3 o return o $tax o Name o name and address o name-and-address o.

EXERCISE IN CLASS CHAPTER 3. PART 1 IDENTIFIER SCENARIO 1 o record1 o 1record o file_3 o return o $tax o Name o name and address o name-and-address o.
CS102--Object Oriented Programming Lecture 5: – Arrays – Sorting: Selection Sort Copyright © 2008 Xiaoyan Li.

CS102--Object Oriented Programming Lecture 5: – Arrays – Sorting: Selection Sort Copyright © 2008 Xiaoyan Li.
© The McGraw-Hill Companies, 2006 Chapter 5 Arrays.

© The McGraw-Hill Companies, 2006 Chapter 5 Arrays.
1 Lecture 9  Arrays  Declaration  Initialization  Applications  Pointers  Declaration  The & and * operators  NULL pointer  Initialization  Readings:

1 Lecture 9  Arrays  Declaration  Initialization  Applications  Pointers  Declaration  The & and * operators  NULL pointer  Initialization  Readings:
Slides prepared by Rose Williams, Binghamton University Chapter 11 Recursion.

Slides prepared by Rose Williams, Binghamton University Chapter 11 Recursion.
Slides prepared by Rose Williams, Binghamton University Chapter 6 Arrays.

Slides prepared by Rose Williams, Binghamton University Chapter 6 Arrays.
Administrative MUST GO TO CORRECT LAB SECTION! Homework due 11:59pm on Tuesday. 25 points off if late (up to 24 hours) Cannot submit after 11:59pm on Wednesday.

Administrative MUST GO TO CORRECT LAB SECTION! Homework due 11:59pm on Tuesday. 25 points off if late (up to 24 hours) Cannot submit after 11:59pm on Wednesday.

Similar presentations

Ads by Google