The Second Computational Chomp Challenge of Ekhad and Zeilberger
Statement
Ekhad and Zeilberger's second computational Chomp challenge asks for a Chomp position with three winning opening moves. Answered by exhibiting a bar with three winning opening moves.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.