The document describes the format of a coderetreat event with 90 coders and 2200 passionate software developers. The format involves periods of deep coding practice and challenge, receiving feedback without pressure, and experimenting freely. Sessions involve 45 minutes of coding, 10 minutes of retrospectives, and breaks in between. Coding tasks follow principles of passing all tests, clear intent, no duplication, and no superfluous parts. Code is deleted after each session and paired programming is used. Variations on the tasks are described. The Game of Life simulation is provided as an example coding task.
21. VARIATIONS
• AVOID TO USE PRIMITIVES
• AVOID TO USE ELSE IN CONDITIONS
• EXTREME TELL DO NOT ASK
• MAX OF 5 LINES OF CODE PER METHOD
• PING PONG PROGRAMMING
• TRY TO USE DIFFERENT CONCEPTS
(GRID GAME CELL...) AS A CENTER
22. VARIATIONS
• AVOID TO USE CONDITIONS
• TRY TO GUESS THE RESULT OF TESTS
• DO NOT USE ARRAYS
• USE ONLY INTERACTION BASED TESTS
• USE ONLY STATE BASED TESTS
• ALL METHODS RETURNS VOID
23. VARIATIONS
• DO NOT TALK WITH YOUR PAIR
• TDD AS IF YOU MEANT IT
• DO NOT USE THE MOUSE
• ONLY USE AUTOMATIC REFACTORINGS
• OCP STYLE
24.
25. THE GAME OF LIFE
IS A TWO
DIMENSIONAL GRID
OF SQUARE CELLS
EACH OF WHICH IS
IN ONE OF TWO
POSSIBLE STATES
ALIVE OF DEAD
26. AT EACH STEP IN
TIME EVERY CELL
INTERACTS WITH
ITS 8 NEIGHBORS
FOLLOWING 3
RULES
27. 1. ANY LIVE CELL WITH FEWER THAN 2
LIVE NEIGHBORS DIES OF LONELINESS
28. 2. ANY LIVE CELL WITH MORE THAN 3
LIVE NEIGHBORS DIES OF OVERCROWDING
29. 3. ANY DEAD CELL WITH EXACTLY 3 LIVE
NEIGHBORS COMES TO LIFE OF WARMTH