Archive for category: Checkers

Translating HAKMEM 175 into C…

September 8, 2010 | Checkers, Computer Science | By: Mark VandeWettering

A couple of years back, I made note of HAKMEM 175, a nifty hack by Bill Gosper that finds the next higher value that has the same number of ’1′ bits as the input. brainwagon » Blog Archive » HAKMEM 175. If I bothered to convert it to C, I didn’t scribble it down, so […]

Share Button

Why I can’t play checkers very well…

May 7, 2010 | Checkers | By: Mark VandeWettering

White is to move. It isn’t that hard to find the move that draws, but in two minutes, I couldn’t work out the move that wins for White. All other moves are dead losses for White. Solving this puzzle requires basic visualization skills which seem beyond my current capabilities. Milhouse of course immediately answers 27-23. […]

Share Button

Milhouse muses from the past…

April 23, 2010 | Checkers | By: Mark VandeWettering

A couple of years ago, I mused about an “easy” checkers problem which my checkers program Milhouse found to be pretty difficult. Here’s the position again, with White to move and win: (I didn’t mention the source of the puzzle before, I got it out of one of Rob Pike’s books, not sure which one. […]

Share Button

Milhouse, what are you thinking?

April 11, 2010 | Checkers | By: Mark VandeWettering

Okay, here’s the problem which is driving me crazy. Milhouse gets itself into this position: Milhouse should play 6-10, and should respond by winning a checker on the next move by forcing the checker that doesn’t move into a trade. But for reasons which somewhat escape me, milhouse judges that 6-2, 6-9 and 6-10 are […]

Share Button

Three Kings vs. Two Kings still confounds Milhouse?

April 10, 2010 | Checkers | By: Mark VandeWettering

A couple of years ago, I realized that Milhouse didn’t play the 3K vs. 2K engame properly. Today, in doing some testing, I realized that it still doesn’t. At one point, it misses the obvious trade in material, and therefore wanders into a draw by repetition. I suspected it is because something is awry in […]

Share Button

It is good to see another checker program work hard…

April 1, 2010 | Checkers | By: Mark VandeWettering

I was sparring a bit with both Martin Fierz’s Cake, his jCheckers and also with John Kruezer’s guiCheckers. These games illustrated a number of things. Milhouse has bugs. And it seriously lacks proper checker knowledge. Because it lacks checker knowledge, it doesn’t search deep enough. And it lacks an opening book. Sigh. It’s hard to […]

Share Button

A small experiment with a C compiler

March 31, 2010 | Checkers, Computer Science | By: Mark VandeWettering

I’m still somewhat baffled by the performance of my checkers program. I keep pondering that perhaps it would be a good idea to take all the lessons I’ve learned, burn it down, and try again with Milhouse2. After all, in the words of Tom Duff (who may not have said this, but should have) “any […]

Share Button

jCheckers Beats Milhouse

March 29, 2010 | Checkers | By: Mark VandeWettering

After watching a couple of games where Milhouse appeared to get behind, but then pulled out a draw, here’s one where milhouse got behind, stumbled, and lost. I haven’t had the opportunity yet to study it in any detail, but I’ll archive the game here for future analysis: [Black "jcheckers"] [White " milhouse"] [Event "sparring […]

Share Button

jCheckers released

March 28, 2010 | Checkers | By: Mark VandeWettering

Martin Fierz, author of the truly excellent checkers program Cake, has released a checkers program in Java. I run Cake on my PC, and also at times under Wine on Linux, but it is nice to have a version which can run on Mac/Linux without any hassle. jCheckers. For fun, I fired up Milhouse and […]

Share Button

Classic Board Games for Computer Implementation?

March 25, 2010 | Checkers, Computer Science, Games and Diversions | By: Mark VandeWettering

So, my experiments with my checkers program Milhouse have been fun and interesting. There is still work to be done: I don’t think a machine that can’t properly play first position can be reasonably said to be a good checkers player (even though I still make errors while practicing it myself against Cake), but I’ve […]

Share Button

Can I derive an adequate evaluation function for Milhouse through random play?

March 20, 2010 | Checkers | By: Mark VandeWettering

As I have mentioned from time to time, I have an implementation of a middling checkers player program that I’ve called Milhouse. Every few months I take time out to play with it and decide what I can do to make it better. Recently I’ve been pondering the possibility of implementing drop-out expansion to make […]

Share Button

Fifth Position, a test for milhouse

February 24, 2010 | Amateur Radio, Checkers | By: Mark VandeWettering

My trip to Powell’s also netted me Erroll A. Smith’s The American Checker Player’s Handbook, a nice little tome published in 1944. It mostly is an introduction to the famous two-move openings, systematically organizing the forty-seven two-move openings into 7 so-called “Master” openings, and then the Major Variations. There are two principle areas that I’d […]

Share Button

Some new additions to my checkers library…

February 20, 2010 | Checkers | By: Mark VandeWettering

A visit to Powell’s books today netted me three new (well, new to me, but used, and in two cases, quite old) books on checkers. It’s been a while since I mentioned my checkers program milhouse, but it’s still in the back of my mind, and these old books provide excellent insight into the game, […]

Share Button

Another checker problem…

January 25, 2010 | Checkers | By: Mark VandeWettering

I was waiting for sleep to come, and surfed over to the American Checker Federation website. As long-time readers of this blog might remember, I’ve been tinkering a checkers program together, which I tentatively named “Milhouse” to play checkers. This week’s problem challenge was a classic 2 on 3 battle where White is to move […]

Share Button

Milhouse takes Quiz #10 – Double Cross

December 22, 2009 | Checkers | By: Mark VandeWettering

Checker expert Jim Loy has a number of quizzes on his website, including the following one that I found as part of my earlier post on the Double Cross opening: Quiz #10 – Double Cross. Here are the moves that milhouse chose with a hard time limit of 30 seconds per move, along with the […]

Share Button