Andreas Chen: The Quicksort game

Abstract

In this thesis presentation, we introduce a new combinatorial game called Quicksort. The game is played on a sequence of numbers, and players move by pivoting around a number in the manner of the familiar Quicksort algorithm. We also examine a variation on the Quicksort game called Pseudo-Quicksort. These games have some very interesting properties: Quicksort games are all-small, while Pseudo-Quicksort games are numbers. The presentation will include a brief introduction to combinatorial game theory.

Supervisor: Jonas Sjöstrand