Base requirements for participating are:
- 💻 Notebook/PC
- ⚡ Stable internet connection
- 🎥 Webcam and microphone (preferably a quite place)
- ✍️ Have prepared project where you can write tests rightaway
Any participant should prepare for pairing with a developer of any platform. Therefore a couple of extra tools should be ready for use. Here is the categorized list:
Worst-Case Scenario Tools
git
(as back-up solution)
REPL and Online Tools
Does not require any installation on your local device, but be sure you have a valid account.
- codesandbox.io
- Remote real time collaboration is described at Collaboration with Live
- Presets available for fork:
- repl.it
- Presets available for fork:
IDE Built-In Tools
IDE | Host Participant Requirement | Guest Participant Requirements |
---|---|---|
IntelliJ IDEA (Java/Kotlin) | Installation + Code with Me Plugin | - |
App Code (Swift) | Installation + Code with Me Plugin | - |
VS Code (JS) | Installation + Live Share Plugin | Installation + Live Share Plugin |
Time | What is happening? 🤔 |
---|---|
before 09:00 | Participants arriving to meeting |
09:00 - 09:30 | Welcome, introduction and overview of what is going to happen |
09:30 - 10:30 | Session # 1 (Pair Programming and Game of Life explained) |
10:30 - 10:45 | Retrospective + short break |
10:45 - 11:45 | Session # 2 (Test Driven Development explained) |
11:45 - 12:00 | Retrospective |
12:00 - 13:15 | Lunch + socializing (big break) 🍕 |
13:15 - 14:15 | Session # 3 (4 Rules of Simple Design explained) |
14:15 - 14:30 | Retrospective + short break |
14:30 - 15:30 | Session # 4 |
15:30 - 15:45 | Retrospective + short break |
15:45 - 16:45 | Session # 5 |
16:45 - 17:00 | Closing circle retrospective |
Participant A | Participant B | Pair Space |
---|---|---|
Mária | Lucia | meeting room + paper |
Vojtěch | Lukáš | meeting room + paper |
Jozef | Adam | meeting room + paper |
Viktor | Daniel | meeting room + paper |
Tomáš | Michal | meeting room + paper |
Rules:
- Game of Life
Participant A | Participant B | Pair Space |
---|---|---|
Daniel | Lukáš | meeting room + paper |
Adam | Viktor | meeting room + paper |
Vojtěch | Lucia | meeting room + paper |
Michal | Mária | meeting room + paper |
Tomáš | Jozef | meeting room + paper |
Rules:
- Game of Life
- TDD - ping-pong
- max 4 lines of code per method/function
Participant A | Participant B | Pair Space |
---|---|---|
Tomáš | Viktor | meeting room + paper |
Lucia | Michal | meeting room + paper |
Lukáš | Mária | meeting room + paper |
Daniel | Jozef | meeting room + paper |
Vojtěch | Adam | meeting room + paper |
Rules:
- Game of Life
- TDD - ping-pong
- 4 Rules of Simple Design
- TDD as if you meant it
Participant A | Participant B | Pair Space |
---|---|---|
Lukáš | Jozef | meeting room + paper |
Daniel | Michal | meeting room + paper |
Viktor | Vojtěch | meeting room + paper |
Adam | Lucia | meeting room + paper |
Tomáš | Mária | meeting room + paper |
Rules:
- Game of Life
- TDD - navigator-drive
- 4 Rules of Simple Design
- no arrays/collections
Participant A | Participant B | Pair Space |
---|---|---|
Vojtěch | Mária | meeting room + paper |
Daniel | Lucia | meeting room + paper |
Tomáš | Lukáš | meeting room + paper |
Viktor | Jozef | meeting room + paper |
Michal | Adam | meeting room + paper |
Rules:
- Game of Life
- TDD - ping-ping
- 4 Rules of Simple Design
- mute
- immutables only
For more information visit the Conway's Game of Life page at Wikipedia.
Any live cell with fewer than two live neighbors dies, as if by underpopulation.
generation x
(n < 2)
⬜ | ⬜ | ⬜ |
---|---|---|
⬜ | 🦠 | ⬜ |
⬜ | ⬜ | 🦠 |
generation x + 1
❔ | ❔ | ❔ |
---|---|---|
❔ | ⬜ | ❔ |
❔ | ❔ | ❔ |
Any live cell with two or three live neighbors lives on to the next generation.
generation x
(n = 2,3)
⬜ | ⬜ | ⬜ |
---|---|---|
🦠 | 🦠 | ⬜ |
⬜ | 🦠 | 🦠 |
generation x + 1
❔ | ❔ | ❔ |
---|---|---|
❔ | 🦠 | ❔ |
❔ | ❔ | ❔ |
Any live cell with more than three live neighbors dies, as if by overpopulation.
generation x
(n > 3)
🦠 | 🦠 | 🦠 |
---|---|---|
🦠 | 🦠 | 🦠 |
🦠 | 🦠 | 🦠 |
generation x + 1
❔ | ❔ | ❔ |
---|---|---|
❔ | ⬜ | ❔ |
❔ | ❔ | ❔ |
Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.
generation x
(n = 3)
⬜ | ⬜ | ⬜ |
---|---|---|
🦠 | ⬜ | ⬜ |
⬜ | 🦠 | 🦠 |
generation x + 1
❔ | ❔ | ❔ |
---|---|---|
❔ | 🦠 | ❔ |
❔ | ❔ | ❔ |
Consists of:
- Tests Pass
- Expresses Intent
- No Duplication
- Small
Further reading - Corey Haines: Understanding the Four Rules of Simple Design.