June 22, 2010 at 16:33ICFP Contest 2010 Reports
From Friday June 18, 2010 from 16:00 Moscow time to Monday 16:00 Moscow time - for exactly 3 days - the annual ICFP Programming Contest was held.
This time, the task , of course, was very interesting and was inferior only to the task of 2007 (DNA lines and images).
Dumb about the assignment. Participants were invited to create cars and fuels for them. In this case, the design of the machine is open information, and the design of the fuel is closed. It is advisable to obtain fuel for as many cars as possible, and to make cars for which it is difficult to select fuel. The earlier the solution is transmitted to the server, the more points it ultimately brings.
The basis of machine and fuel coding is trits - information units that take one of three values (0, 1, 2). And cars and fuels are chains of trit. But at the same time, fuel cannot be transferred directly - you need to build a factory for its production. And for this you need to first guess about the coding method of the factory and the internal structure of its elements ...
Here are collected Russian-language reports of participating teams:
Links to English-language reports can be found here .
After the end of the contest time, an explanation of the source of the assignment was posted from the organizers .
See also: ICFPC'09 Reports .
This time, the task , of course, was very interesting and was inferior only to the task of 2007 (DNA lines and images).
Dumb about the assignment. Participants were invited to create cars and fuels for them. In this case, the design of the machine is open information, and the design of the fuel is closed. It is advisable to obtain fuel for as many cars as possible, and to make cars for which it is difficult to select fuel. The earlier the solution is transmitted to the server, the more points it ultimately brings.
The basis of machine and fuel coding is trits - information units that take one of three values (0, 1, 2). And cars and fuels are chains of trit. But at the same time, fuel cannot be transferred directly - you need to build a factory for its production. And for this you need to first guess about the coding method of the factory and the internal structure of its elements ...
Here are collected Russian-language reports of participating teams:
- Team 6-11, 13th place
- SnakeTeam Team, 15th place
- Thiscodeismade team, 19th place
- Hack-the-loop team, 22nd place + task analysis
- THIRTEEN Team, 30th
- Futamura Rejection team, 31st place - the most interesting report, from _adept_
- Nbu team, 40th place
- Oroborus team, 51 place
Links to English-language reports can be found here .
After the end of the contest time, an explanation of the source of the assignment was posted from the organizers .
See also: ICFPC'09 Reports .