Go to Post A Strong FRC Team Should... have a clear vision and an understanding of how to achieve it within their means. - jwfoss [more]
Home
Go Back   Chief Delphi > Competition > Rules/Strategy
CD-Media   CD-Spy  
portal register members calendar search Today's Posts Mark Forums Read FAQ rules

 
Closed Thread
Thread Tools Rate Thread Display Modes
  #1   Spotlight this post!  
Unread 07-01-2003, 14:00
Kevin Watson's Avatar
Kevin Watson Kevin Watson is offline
La Caņada High School
FRC #2429
Team Role: Mentor
 
Join Date: Jan 2002
Rookie Year: 2001
Location: La Caņada, California
Posts: 1,335
Kevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond repute
Stack Height Scoring Analysis

Question: Is there an optimum stack height?

Answer: Yes, there is.

Let n represent the total number of containers
in our scoring area. For the sake of our
calculations, this is a constant value.

Let x represent the number of containers that we
use to make our stack.

Then n-x equals the number of containers in the
scoring area not used in building the stack.

Our score, excluding "king-of-the-hill" points,
can then be calculated by multiplying our stack
height by the number of containers not used in
building our stack. Creating a mathematical
expression for this we get:

score = x(n-x)
= nx-x^2
= -x^2 + nx

So the (oft quoted) quadratic coefficents are:

a=-1
b=number of containers in our alliance's scoring area
c=number of "king-of-the-hill" points

** Calculus Alert **

Now to optimize our score we take the derivative
of the above equation...

score' = -2x + n

...and then solve for x when score' is held at zero.

-2x + n = 0
-2x = -n
x = -n/-2
x = n/2

What this expression says is that we will get the
maximum score if we use half of the available
containers in the scoring area to build our stack.

Homework question:

This falls apart if n is odd. Afterall, how do you
stack half of a container?!? So my question is simply:
Given an odd number of containers in your scoring
area, do you put that last, odd-numbered container on
the stack or not?

Hint:

Well, first you might just make a table that relates
the two possible scores for each case (n=3,5,7,etc).
Then if you're still curious, you might want to do a
mathematical proof to convince yourself that this
still holds true for a million and one containers in
the scoring area.

-Kevin
__________________
Kevin Watson
Engineer at stealth-mode startup
http://kevin.org
  #2   Spotlight this post!  
Unread 07-01-2003, 14:53
jeremy562 jeremy562 is offline
Engineer
#0562 (SPARK 562)
 
Join Date: Feb 2002
Location: Fitchburg, MA
Posts: 74
jeremy562 is an unknown quantity at this point
Send a message via AIM to jeremy562
Don't put the odd numbered container on the stack.

Technically, it doesn't matter if you do or not. Your resulting score will be exactly the same (for example, 8 * 9 vs. 9 * 8). However, if you attempt to stack that last crate, you're risking (a) accidentally knocking over the stack, (b) an opponent knocking over the stack when you could have been defending it, and (c) not releasing the crate before time expires, in which case I don't believe it counts towards your score at all.
  #3   Spotlight this post!  
Unread 07-01-2003, 15:00
Kevin Watson's Avatar
Kevin Watson Kevin Watson is offline
La Caņada High School
FRC #2429
Team Role: Mentor
 
Join Date: Jan 2002
Rookie Year: 2001
Location: La Caņada, California
Posts: 1,335
Kevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond reputeKevin Watson has a reputation beyond repute
Quote:
Originally posted by jeremyw_562
Don't put the odd numbered container on the stack.

Technically, it doesn't matter if you do or not. Your resulting score will be exactly the same (for example, 8 * 9 vs. 9 * 8). However, if you attempt to stack that last crate, you're risking (a) accidentally knocking over the stack, (b) an opponent knocking over the stack when you could have been defending it, and (c) not releasing the crate before time expires, in which case I don't believe it counts towards your score at all.
Excellent! This is exactly what I was looking for. Now for extra credit, how about a formal proof of this .

-Kevin
__________________
Kevin Watson
Engineer at stealth-mode startup
http://kevin.org
  #4   Spotlight this post!  
Unread 07-01-2003, 15:20
DaBruteForceGuy's Avatar
DaBruteForceGuy DaBruteForceGuy is offline
aKa - Steve Bennett
FRC #0125 (NUtrons)
Team Role: College Student
 
Join Date: Feb 2002
Rookie Year: 2001
Location: Boston / Smithtown NY
Posts: 379
DaBruteForceGuy is an unknown quantity at this point
Send a message via AIM to DaBruteForceGuy
Cool

Quote:
This falls apart if n is odd. Afterall, how do you stack half of a container?!?
I dunno, as one might see in the other threads, those containers are pretty brittle..... And we all know what happens when bruteforce is encorperated into a math equation...
icky, broken stuff!

Quote:
Excellent! This is exactly what I was looking for. Now for extra credit, how about a formal proof of this .
You can't! lol, But hey, isn't that whats makes FIRST wonderful?!
__________________
Team
810 > 2001-2005 - Student Founder
125 > Present - College Student

---The pessimist complains about the wind, the optimist hopes that the wind will change... the realist adjusts the sail.
***<Therapist> Tell me, is the glass half full or half empty?
***<Engineer> Neither, the glass is too big.---

....Uh, GO NUTRONS!

Last edited by DaBruteForceGuy : 07-01-2003 at 15:23.
  #5   Spotlight this post!  
Unread 07-01-2003, 16:10
jeremy562 jeremy562 is offline
Engineer
#0562 (SPARK 562)
 
Join Date: Feb 2002
Location: Fitchburg, MA
Posts: 74
jeremy562 is an unknown quantity at this point
Send a message via AIM to jeremy562
The easy proof is the commutative property of multiplication, and my calculus is too rusty to do it for real. Here's my best attempt:

Given x, an odd number of containers in scoring position,
let y = the optimal stack height (which you have proofed)

y = x/2

In the case of an odd number of containers, y will be a complex fraction (where x = 11, y = 5 1/2). Since we cannot have 1/2 a container, we must round y either up or down, by adding 0.5 or subtracting 0.5.

We can calculate 2 scores based on (1) adding another container to the stack and (2) not adding another container to the stack.

s1 = (y+0.5) (y-0.5)
s2 = (y-0.5) (y+0.5)

Given the commutative property of multiplication (which states that A*B=B*A), we prove that s1 = s2.
Closed Thread


Thread Tools
Display Modes Rate This Thread
Rate This Thread:

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

vB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Forum Jump

Similar Threads
Thread Thread Starter Forum Replies Last Post
Initial stack height JJG13 Rules/Strategy 1 29-01-2003 21:04
Stack Attack PDA Scoring Calculator Matt Starkey Rules/Strategy 15 23-01-2003 10:52
Multiplier stack scoring change??? Jferrante Rules/Strategy 7 08-01-2003 12:23
Stack height Poll (spawn from other thread) Andrew Rudolph Chit-Chat 5 07-01-2003 17:15
Scoring when an opponent is in contact with your tallest stack. Randy Ai Rules/Strategy 1 06-01-2003 17:17


All times are GMT -5. The time now is 04:12.

The Chief Delphi Forums are sponsored by Innovation First International, Inc.


Powered by vBulletin® Version 3.6.4
Copyright ©2000 - 2017, Jelsoft Enterprises Ltd.
Copyright © Chief Delphi