Warmup Match Tips : From the Official Site

Welcome Back, this article contain the Judging Tips with Algorithm Competetion in IC 2008
This copied from the Competetion Official web site:
You can read more on the following Link:
http://www.wildnoodle.com/ic2008al/ui/judgingprocess.aspx
"

Let
Points be the points assigned for solving the level (based on
difficulty)TotalButtons be the number of white buttons on the level Buttons be
the number of white buttons you have pressed MaxBytes be the maximum number of
bytes for the level Bytes be the number of bytes actually used
Then
If
Buttons = TotalButtons and Bytes <= MaxBytes, you have solved the level. Your score will be (Points*MaxBytes)/Bytes. If Buttons <> MaxBytes, you have not solved the level. Your score will be
Buttons*PointsPerButton, where PointsPerButton is determined as follows:
If
Bytes <= MaxBytes, PointsPerButton = (Points/(2*TotalButtons)). This is an integer divide and the result may be zero. If MaxBytes < pointsperbutton =" (Points*(2*MaxBytes" pointsperbutton =" 0">

"
the judgin process looks like fair, gonna for partcepating, Be on touch

Herbert Robot : 'h' Language

In this article we will discuss the 'h' language the metod that will make you contact with Herbert - Our hero! ;)

h Language has many advantages that will make you contril Herbert
it is simple and powerful
it contain Statements ,Procedures, Arguments and Recursion

Let's Go forward:
1- the Statements:
statement is either command, procedure cal or procedural parameter,
2- Commands:
Herbert can go forward, turn left or turn right just order him
l : turn Left.
r : turn Right
s : go Straight
3- Procedure Defination
x[(P₁,P₂,P₃,...P_k)]:c₁c₂c₃...c_y
x is the Procedure name.
P_k a parameter 0<= k <= 15 c_y procedure command y > 0
4- Parameters:
parameters ( procedure arguments ) should be Capital letters.
5-Expression:
[-]X[[+/-X[+/-X..]]]
each X is either parametre or number
6- Arguments
a procedure argument can be number , Expression or statement.
7- Procedure Call:
x[(a₁,a₂,a₃,...)]
x is the procedure name and ai is an argument
Note: no Procedre call if any numeric argument is 0 or less.
8- Recursion:
a call stack is available for recursion
f(A):sf(A-1)

in the next article we will review some examples how to manage Herbert and may review some problems from the warmup match next 27-9
Salam!