This is just a scaled down version of questions to be expected in the actual event, do note that the questions in the actual rounds will necessarily be different from these.
1.1 Programming Sample
Make a program that plays the ancient game of Go on a 9X9 grid. Your code should be capable of exhibiting artificial intelligence.
Rules:
The Game starts with Black stone's move . . .
There are two players for this game. One is the black stone player and the other the white stone player. The black stone player always goes first in placing a stone in the intersections of the board and then they take turns during the game. You cannot move a stone once its place and it will not move until it's captured.
Go has three basic rules and they are . . .
When a stone or several stones are completely surrounded with no empty points (liberties) within the surrounding area, they are captured. Once captured, the dead stones are removed from play. When a group of stones have only one remaining liberty it is considered to be an "Atari", which is similar to "check" in chess.
Suicide move is an illegal move in GO Game. When a player places a stone to be simply captured by the opponent, the move is an illegal move and such a move is not allowed.
If a move would result in the same board pattern that existed before the opponent's move, the player is required to abstain from that move and make a move elsewhere. This situation is known as a KO (the knot). This rule is used to prevent stalemates and endless repetition.
The game is over when the possibilities for gaining territory or capturing the stones have ceased to exist. The winner is the person who has gained the most territory.
Scoring: When both players keep passing because a move cannot be completed then the game is over. The number of empty points he has completely surrounded to the number of points the stones are placed on is how you get the score for the game. A point that is completely surrounded is counted as the player's territory. You don't count the points that have not been completely surrounded.
Winning: After the score has been added we must consider the fact that black was first so he had the advantage. To compensate for that, 6-1/2 points are added to the final tally of the second player. This is done only if two games were not played with alternate turns of being the black stone. This kind of handicap is called "Komi".
More information about the game is available online. Participants must follow Chine Go rules.
1.2 Algorithms Sample
Explain what the following code does?
#define _ -F<00||--F-OO--;
int F=00,OO=00;main(){F_OO();printf("%1.3f\n",4.*-F/OO/OO);}F_OO()
{
_-_-_-_ _-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_ _-_-_-_
}
1.3 Debugging Sample
Find the error in the following code, and justify.
void func (int &i) { }; int main () { int x,y; func (x+y); }
You need to participate to know about this round. Keep guess!
Find a username for the crackme using reverse engineering. To get the file, Click here.
4.1 Hardware and OS Sample
What is the MAC ID of your NIC card? Justify.
How do you disable the low disk space warning in MS Windows?
4.2 Triva Sample
The world's first digital videogame was __________.
The first literal computer bug was __________.
For further queries and suggestions use the forum.
Disclaimer: All brand names, logos and trademarks mentioned are the properties of their respective owners. We strongly discourage violation of copyright laws, and do not bear any responsibility for any such material used by the participants.