First Loses NoCycle for Small \(n\)

Random number: 29

2nd December 2016

So I made a minimax algorithm to check who wins the NoCycle game for small values of \(n\). It was a very tiring experience, but turns out for \(n\) up to \(7\) first player always loses. I feel like that's enough empirical evidence to prove that for all \(n\), first player loses. Just gut feeling. There were some parts to it though, alpha-beta pruning... Too Tired.