-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
2 changed files
with
59 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,50 @@ | ||
Welcome to the Lambda-Man course. | ||
|
||
It was the year 2014, and many members of our community worked hard to control Lambda-Man. Now, ten years later, this wonderful event is still memorized by holding a small Lambda-Man competition. | ||
|
||
This course will teach you how to optimally control Lambda-Man to eat all pills. There is no fruit involved (neither low-hanging nor high-hanging), and even better: no ghosts! The input to each problem is a simple rectangular grid such as the following: | ||
|
||
``` | ||
###.#... | ||
...L..## | ||
.####### | ||
``` | ||
|
||
The grid contains exactly one `L` character, which is the starting position of Lambda-Man. There will be one or more `.` characters indicating the locations of pills to be eaten, and `#` characters are walls. The outside boundary of the grid is considered to consist of walls as well. | ||
|
||
A solution should be a string of `U`, `R`, `D` and `L` characters (up, right, down, left, respectively) indicating the path to take. For example, a possible solution to the above example grid is the following path: | ||
``` | ||
LLLDURRRUDRRURR | ||
``` | ||
When Lambda-Man is instructed to move into a square containing a wall, nothing happens and the instruction is skipped. our solution may consist of at most `1,000,000` characters. | ||
|
||
The following levels are available: | ||
* [lambdaman1] Best score: 33. | ||
* [lambdaman2] Best score: 44. | ||
* [lambdaman3] Best score: 58. | ||
* [lambdaman4] Best score: 176. | ||
* [lambdaman5] Best score: 159. | ||
* [lambdaman6] Best score: 73. | ||
* [lambdaman7] Best score: 181. | ||
* [lambdaman8] Best score: 138. | ||
* [lambdaman9] Best score: 114. | ||
* [lambdaman10] Best score: 857. | ||
* [lambdaman11] Best score: 1668. | ||
* [lambdaman12] Best score: 1668. | ||
* [lambdaman13] Best score: 1668. | ||
* [lambdaman14] Best score: 1668. | ||
* [lambdaman15] Best score: 1668. | ||
* [lambdaman16] Best score: 2633. | ||
* [lambdaman17] Best score: 991. | ||
* [lambdaman18] Best score: 4361. | ||
* [lambdaman19] Best score: 5122. | ||
* [lambdaman20] Best score: 6489. | ||
* [lambdaman21] Best score: 10609. | ||
|
||
To submit a solution, send an ICFP expression that evaluates to: | ||
|
||
``` | ||
solve lambdamanX path | ||
``` | ||
|
||
our score is number of bytes that the ICFP expressions consists of (i.e. the size of the POST body), so a lower score is better. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters