Stack Attack

Stack Attack

Infobox_FRC_Game
game_title = Stack Attack

year = 2003
number_teams = 787 [ [http://www.usfirst.org/uploadedFiles/Who/Annual_Report-Financials/FirstAnnual06(1).pdf first inside spreads ] ]
number_regionals =
championship_location = Reliant Park, Houston, Texas
chairman_winner = Team 103 - "Cybersonics"
wf_winner = Andrew Baker
founders_winner =
champions = Team 65 - "The Huskie Brigade"
Team 111 - "WildStang"
Team 469 - "Las Guerrillas"

Stack Attack is the game for the 2003 FIRST Robotics competition. In Stack Attack, two teams of two robots each attempt to win by moving large Sterilite bins into their zone and arranging them into stacks.

Layout

At the beginning of the match, each team is given 4 bins, which they may arrange as they see fit. Each of these bins are marked with a retroreflective tape that is highly visible to the infrared sensors included in the kit of parts. In the center of the field on top of the ramp is a large stack of 29 bins.

Object

The object of this game is for each two player alliance to rack up more points than the other team. Scoring is one point for every bin in an alliance's scoring zone the bins in their highest stack, multiplied by the height of their highest stack. Each robot on the top of the ramp at the end of the match adds 25 points to an alliance's score. Bins that are supported by a robot do not count towards the final score.

Gameplay

Human Player

The Human player period is 10 seconds at the start of the match where one designated person from each team may walk onto the field and pass or receive one or more of their four bins to their allied team's human player. This allowed teams to create stacks higher than the initial 4-high stacks. The human players needed to return to a pressure-sensitive pad before their robot was activated.

Autonomous

The autonomous period was 15 seconds long in Stack Attack. During the autonomous period, teams could use infrared sensors to hunt the opposing team's stacks, use the same sensors to follow white tape or use dead reckoning to navigate to the center stacks.

Human-controlled

The human controlled phase began immediately after the autonomous period. During this phase, robots would attempt to amass the most bins on their side, while preventing the opposing teams from getting bins onto their scoring area and knocking down opposing stacks. Robots that were capable of stacking would use this time to begin building and protecting a stack of bins.

trategies

Autonomous

The most successful strategy in autonomous mode was to get the robot to run through the centre stack and push as many bins as possible onto that robot's scoring end. Since it was very difficult to move bins from one end of the field to the other, once most of the centre bins landed in one end, often that team would win. Teams could also try to seek out and knock over the stacks of bins that the human players had placed at the start of the match.

Human Controlled Game

Often the main game was a chaotic period where teams would try and clear out their own zone while attempting to keep as many bins on their scoring section as possible. Robots that were capable of stacking would usually protect their stack for the entire match, then release it just as the match ended.

References

External links

* [http://www.usfirst.org/robotics/ FIRST Robotics]


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Stack (data structure) — In computer science, a stack is an abstract data type and data structure based on the principle of Last In First Out (LIFO) . Stacks are used extensively at every level of a modern computer system. For example, a modern PC uses stacks at the… …   Wikipedia

  • Stack buffer overflow — In software, a stack buffer overflow occurs when a program writes to a memory address on the program s call stack outside of the intended data structure; usually a fixed length buffer.cite web last = Fithen first = William L coauthors = Seacord,… …   Wikipedia

  • USS Stack (DD-406) — Career (US) …   Wikipedia

  • 2010 Austin suicide attack — Panorama of the building the day after the plane crash Location 9430 Research Boulevard …   Wikipedia

  • Return-to-libc attack — A return to libc attack is a computer security attack usually starting with a buffer overflow in which the return statement on the stack is replaced by the address of another instruction and an additional portion of the stack is overwritten to… …   Wikipedia

  • Crack Attack! — Infobox VG| title = Crack Attack! developer = Daniel Nelson Andrew Sayman publisher = designer = engine = released = 2000 Version 1.1.3 2002 Version 1.1.8 2003 Version 1.1.10 Oct 22 2004 Version 1.1.11 Mar 27 2005 Version 1.1.12 Apr 23 2005… …   Wikipedia

  • Format string attack — Format string attacks are a class of software vulnerability discovered around 1999. Previously thought harmless, Format string attacks can be used to crash a program or to execute harmful code. The problem stems from the use of unfiltered user… …   Wikipedia

  • Charles "Bud" Stack — Charles R. Bud Stack (born September 26, 1935) is a Florida lawyer and a former federal judicial nominee to the U.S. Court of Appeals for the Eleventh Circuit whose nomination became a campaign issue during the 1996 presidential campaign. Early… …   Wikipedia

  • Graham Stack (footballer) — Infobox Football biography playername = Graham Stack fullname = Graham Christopher Stack dateofbirth = birth date and age|1981|9|26|df=yes cityofbirth = Hampstead countryofbirth = England height = 6 ft 2 in (1.88 m) position = Goalkeeper… …   Wikipedia

  • Charles Stack — Charles R. Bud Stack (born September 26, 1935) is a Florida lawyer and a former federal judicial nominee to the U.S. Court of Appeals for the Eleventh Circuit whose nomination became a campaign issue during the 1996 presidential campaign.… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”