computer science

Sometime when I was in 7th grade, at Ophelia Parrish Junior High school, a couple of guys that I knew showed me Northeast Missouri State University’s teletypes.

I have four algorithms in my second attempt at writing algorithmic “players” for the game of Squava:

1. Alpha-beta minimaxing
2. Alpha-beta minimaxing with a better static evaluation function
3. Monte Carlo Tree Search
4. Monte Carlo Tree Search with UCT child selection

At this point, all but plain MCTS (#3 above) regularly beat me. How do my programmatic squava players do against each other?

I made a weird third guess due to coffee deficiency.

NYT Wordlebot claimed I had two choices after my 3rd guess. Let’s see if it’s correct.

Once upon a time, I wrote a reasonably-strict-C89 C language program that “relocates” a function in memory and then runs it. That relocated function can relocate itself again, and run that copy, and so on and so forth.

Github repo for this program

I was curious about whether the “hint” that you get with an official Cryptoquip makes any difference.

I was also curious about how hard it is to construct a decent Cryptoquip.

Previous Cryptoquip Post

Cryptoquip Solver Github Repo