Skip to main content
4 votes

General Approach to Solving Cryptarithms

Unless you count things like "use a computer to just try all the possibilities", I don't think there's any really systematic approach. But here are some things I do when solving cryptarithms....
Gareth McCaughan's user avatar
4 votes

How fast can you win this (very stupid) game?

Here is a table of how many turns it takes for player 2 to win (-1 if player 1 can draw): ...
causative's user avatar
  • 314
3 votes

How fast can you win this (very stupid) game?

Lets start the ball rolling with some examples. k=1, N <= 1 : P1 can draw. P1 can draw by playing m1 = N. P2 has to match that to avoid instant loss. Both have run out of money so game is a draw. ...
Penguino's user avatar
  • 14k
3 votes

How fast can you win this (very stupid) game?

Thank you to @causative for the code and @GentlePurpleRain's comment. I will prove that (for $K\ge 2$) $N\ge 2K$ wins $N\le 2K-1$ draws The number of moves for the fastest win for $N=2K$ is $\ge \...
Benjamin Wang's user avatar
2 votes

Blindfolded tic-tac-toe with a twist

Retudin's user avatar
  • 9,316
2 votes

General Approach to Solving Cryptarithms

As Gareth's post is close to unbeatable and I think it would be nice to have one authoritative comprehensive answer, this cw is for donations which Gareth may or may not choose to incorporate in his ...
1 vote

Prisoners and warden game, again?

I can almost prove that a lower bound is Conditional on this statement which is reasonable, but I have not been able to prove: If that statement is assumed, we can renumber if necessary so that It ...
Nitrodon's user avatar
  • 354

Only top scored, non community-wiki answers of a minimum length are eligible