Want to participate? Send an e-mail to w.a.kosters@liacs.leidenuniv.nl before Monday afternoon February 12, 2018, with an answer to the following exercise from the Siegel book: Show that Blue-Red Hackenbush does not have N-positions, i.e., in ordinary Hackenbush there are no positions where the first player can always win.

Subject: "Combinatorial Game Theory"

Literature: see below.

Schedule: Spring 2018, Tuesday mornings, 11:00-12:45;
February 6-May 15, 2018.

Location: Snellius, room 407-409.

Contents | Schedule | Participants | Deliverables | References

The **Seminar (Combinatorial) Algorithms**
is intended for Master students in Computer Science.
Lectures are in English.

The seminar is organised by
dr. H.J. (Hendrik Jan) Hoogeboom
and
dr. W.A. (Walter) Kosters.

This year's subject is "Combinatorial Game Theory".

In the first half of the semester every student presents a part
from the book/papers mentioned above/below. After that
students should study recent literature (or later chapters of the book)
and present their results. And maybe do some programming ...

Meetings are on a weekly basis.
Students can also suggest neighbouring subjects. For a somewhat
more detailed list, see below.

Credit points: **6 ECTS**.
There is no written exam.

**Prerequisites**:
Algorithms, Complexity, Datastructures
(all at bachelor's level, see for
instance the Dutch course pages
Datastructures
and
Complexity).

Students should **register in advance**, in December 2017,
by personal visit to the organizers (come on, please do this).
The number of participants is at most 10 (approximately :).

Students are supposed to present and discuss papers, during class. The setup depends on the number
of participants.

Every student presents two papers, one in each half of the semester. Each presentation takes about 30 minutes, so in a session we have three presentations.
Next to the oral presentations
(using PDF or PowerPoint slides, with the additional help of the
blackboard) ± ten
page self-contained essays on the subject must be written (in
LaTeX; in English/Dutch).
See here for a template;
and this is what it will look like.
Deadline: one month after the presentation.

Essays should be improved until students and organizers
agree on the contents. Students must be present
during all sessions, and are supposed to actively
take part in the presentations, e.g., ask questions.
Some form of peer review will be used.
Immediately after each lecture there is a short
discussion between students and organizers,
where the presentation is evaluated.
The first and second meetings are used to make a proper schedule.
Every student is supposed to choose and present two subjects,
one in the first half and one in the second half of the seminar.

Students should use their own laptop for the presentations.
It is wise to also have the slides for the presentation on a memory-stick, in PDF.
A beamer is always available.

**Grading**
The final grade is composed of the four Ps:
presentation (2x), paper (2x),
participation (including presence) and peer review OR programming.

- February 6, 2018: slides and subjects.
- February 13, 2018: scheduling.
- February 20, 2018: Laurens (Siegel 1-7), Niek (8-14) and Simon (15-21).
- February 27, 2018: Stef (179-183), Julius (184-188) and Dennis (188-192).
- March 6, 2018: Geerten (WW 7-13), Luc (WW 19-28) and Hendrik Jan (recap).
- March 13, 2018: Jarno (53-57), Liam (57-60) and Roy (64-67).
- March 20, 2018:
Pim (87-88), Micky (88-89) and Diederick (91-93).

========== 2nd half: ============== - March 27, 2018: subjects (2).
- April 3, 2018:
- April 10, 2018:
- April 17, 2018:
- April 24, 2018:
- May 1, 2018:
- May 8, 2018:
- May 15, 2018:

========== 1st half: ==============

name | remarks | |
---|---|---|

subject | who | remarks |
---|---|---|

======================= | ===== | ===== |

======================= | ===== | ===== |

- E.R. Berlekamp, J.H. Conway and R.K. Guy, Winning Ways for your Mathematical Plays, Academic Press, two volumes, 1982. Second edition: AK Peters, four volumes, 2001-2004.
- A.N. Siegel, Combinatorial Game Theory, AMS, 2013.
- J.H. Conway, On Numbers and Games, second edition, AK Peters, 2001.
- T.S. Ferguson, Game Theory, Part 1: Impartial Combinatorial Games, web version

February 21, 2018 — **http://www.liacs.leidenuniv.nl/~kosterswa/semalg/index.html**