(he/they) Professor of Computer Science at Florida Southern College. Researcher: Computational Complexity and Combinatorial Game Theory. Interested in: Voting Systems, HPC + OOP, Magic: The Gathering.
At #Integers2025 this spring, I collaborated with a new group and proved that Misere Partizan Arc Kayles is PSPACE-complete. That paper just went up on the arXiv: https://arxiv.org/abs/2511.21888
For that paper we implemented two new playable games: Misere Partizan Arc Kayles itself (https://kyleburke.info/DB/combGames/miserePartizanArcKayles.html) and a Normal-Play version of Bounded Constraint Logic (https://kyleburke.info/DB/combGames/normalBoundedConstraintLogic.html).
I'm especially excited about how clearly we talked about using Constraint Logic to provide computational hardness.
On Monday, November 17, at 3:30pm ET, I get to give the next VCGT talk on the computational complexity of the game #BattleSheep: https://sites.google.com/view/virtual-cgt/seminar
Abstract: Battle Sheep is a board game published by Blue Orange Games where players take turns moving stacks of sheep tokens around a hexagonal board, always leaving at least one sheep behind. In this talk we'll learn the basics of the game, play once, and finally show that determining the winnability of the game is PSPACE-complete. This talk assumes no prior knowledge of computational complexity.
Long overdue: I added TwixT to my table of combinatorial games: https://kyleburke.info/rulesetTable.php#Twixt #CombinatorialGames
It's early enough in the semester that I can get away with playing some #BattleSheep between classes.