Decision models play Skull
I had three decision models (Jev, OpenJev, Luna Decisions) play 100 games of Skull, a game about lying, against Claude Haiku 4.5 as the control. In Skull the top bidder turns over their own discs first. A bid that reaches past your own skull can't succeed, and that can be checked from the bidder's own discs with no solver.
What I foundJev made the most impossible bids, 220 of them, and won the most games, 45 of 100. It put its skull down first all 281 times it had the choice, then bid past it. Luna Decisions passed on 75% of its chances to raise and finished last. I rebuilt every bid as a yes-or-no question and played 98 more games, and the order of wins held.
















