Thursday, September 27, 2007

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:

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
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:
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

Friday, September 21, 2007

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 is the Procedure name.
Pk a parameter 0<= k <= 15 cy procedure command y > 0

4- Parameters:
parameters ( procedure arguments ) should be Capital letters.
each X is either parametre or number
6- Arguments
a procedure argument can be number , Expression or statement.
7- Procedure Call:
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

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

Sunday, September 16, 2007

IC 2008: Herbet Robot in Algorithm Competetion

welcome all:

we will talk closer about the Algorithm Competetion in Imagine Cup 2008

It will be a series begin with this article untill the begining of Matchs on 15/10/2007

Let's begin,

Algorithm Invitational contest is in the form of a game called "Herbert". Herbert requires you to solve a series of levels by writing small programs in specified language to control a robot. The simpler and more elegant your solution, the more points you get.

before begin you may able to download Herbert Program for this tutorial from HERE

after downloading the program start it and login with the email account and password you have have set it in the signup process on Link

each match consist of set of levels on each level you have white buttons that must be pressed (Robot Walk Over it) to pass the level.

after logging on the program the Interface will looks like this
To press the buttons, you have at your disposal a programmable robot named Herbert. You must program Herbert, in a language called “h”, to press all the white buttons while avoiding obstacles such as walls and gray buttons (walls block Herbert's path and gray buttons will reset any previously pressed white buttons to their unpressed state). You are only allotted a certain number of "bytes" (a unit of program size) per level, your program must use no more than this number of bytes
On each level, points are awarded for each white button pressed, a bonus is awarded for solving the level, and extra points are awarded for those solutions that use less than the allotted maximum number of bytes.
Soo What next...
the next is what you should know to compete in Algorithm Competetion
The 'h' Language
'h' Language is the way you will contact Herbert and order him
“h” contains elements of traditional high-level languages: statements, procedures, parameters, arguments, and recursion. However, “h” is syntactically more simple, and contains some concepts (procedural arguments) that are not found in traditional languages.
we will talk about 'h' Language in the next article

Saturday, September 15, 2007

Imagine Cup 2008 : Algorithm Competetion


In this month the chellange will just start in Imagine Cup 2008
the Algorithm competetion will begin this month round 1 will end on 1 Feb. and the table time will be:-
Complete online programming challenge (Herbert
09/27 - 10/10 : Warmup Match
10/25 - 11/07 : Match 1
11/22 - 12/05 : Match 2
12/20 - 01/02 : Match 3
01/17 - 01/30 : Match 4

the match will begin at 00:00 GMT <1st>
and ends at 23:59:59 GMT
for example:
Warmup Match will begin on 09/29 at 00:00 GMT and end on 10/10 at 23:59:59 GMT

the competetion will be on Herbert and to The discovery and use of the right algorithms, and clever implementations and application, are building blocks upon which the whole field takes collective steps forward. It is through this remarkable skill that we can attempt unimaginable feats like decoding the human genome, routing millions of packets across networks, and even searching the entire Internet. The Algorithm Invitational takes competitors through a series of brain teasers, coding challenges, and algorithmic puzzles, and seeks to engage the sharpest student minds in technology around interesting problems.

be on touch to know about the Competetion.