Programming

Javascript Boggle

thesamovar — Thu, 05 May 2011 03:29:28 +0100

One day when I was planning to have a game of Boggle and didn't have a copy of a physical board to hand, I thought it would be good to have a pure HTML+Javascript version of the game that could be played on any computer. Thus jsboggle was born. Fortunately, I'd already, at some point in the distant past, written a boggle board generator and solver in C++ so it was just a matter of rewriting it for JavaScript (surprisingly easy, although involved a bit of looking stuff up as I didn't know the language very well).

To play it, simply unpack the zip file to a directory and it should be obvious what to do. The solver takes almost no time to solve a board, even though it's in JavaScript.

Attachment	Size
jsboggle.zip	682.1 KB

Quasiregular dynamics

thesamovar — Mon, 31 May 2010 12:47:44 +0100

With Alastair Fletcher, I wrote some code for producing images of Mandelbrot and Julia sets for quasiregular mappings. A paper on this is currently in review, and can be accessed from arxiv.org. The code used to generate the images can be downloaded from the zip file below, including a description of how it works. The code requires Python 2.5/6 and Numpy.

Attachment	Size
qr_dynamics.zip	8.78 KB

Countdown numbers game solver

thesamovar — Wed, 02 Jan 2008 10:44:41 +0000

While learning Python, I wrote the program attached below to solve the Countdown numbers game. From what I've seen on the web, my program is simpler than any of the other programs with source code out there. Having written it I found this paper which uses a very similar solution to mine (but in Haskell rather than Python).

The source code for the first version is heavily commented with algorithmic details. It takes about 15 seconds to find all solutions on my 2.4GHz laptop.

My ideal (as always with Python) was to write a program you could just look at and understand without comments, but I don't think I achieved that. The first version certainly doesn't, but maybe the second version does. I'd be interested if a more experienced Python programmer could do better in this respect. Let me know.

This snippet is from the second version (slower, 40 seconds to find all solutions) which is supposed to be understandable without comments:

def ValidExpressions(sources,operators=standard_operators,minimal_remaining_sources=0):
    for value, i in zip(sources,range(len(sources))):
        yield TerminalExpression(value=value, remaining_sources=sources[:i]+sources[i+1:])
    if len(sources)>=2+minimal_remaining_sources:
        for lhs in ValidExpressions(sources,operators,minimal_remaining_sources+1):
            for rhs in ValidExpressions(lhs.remaining_sources, operators, minimal_remaining_sources):
                for f in operators:
                    try: yield BranchedExpression(operator=f, lhs=lhs, rhs=rhs, remaining_sources=rhs.remaining_sources)
                    except InvalidExpressionError: pass

def TargetExpressions(target,sources,operators=standard_operators):
    for expression in ValidExpressions(sources,operators):
        if expression.value==target:
            yield expression

Attachment	Size
countdown-numbers-solver.py.txt	8.42 KB
countdown-numbers-solver-2.py.txt	2.8 KB

Countdown Letters ME

thesamovar — Tue, 10 Jul 2007 02:04:32 +0100

Impressed by the abilities of my new mobile phone - the K750i is actually now rather old by mobile phone standards - I thought I'd see what I could do with J2ME (that's Java for mobile phones). Thus was born the Countdown letters game solver. You enter the letters as they are read out by Carol, hit solve and in no time your phone will tell you the 5 best words you can get with those letters (and without connecting to the internet, all the data is on the phone). It takes about 10 seconds on my phone, newer phones would probably be even quicker.

You can download the JAR and JAD files at the bottom of this page. I don't know about other phones, but the way you install them on my phone is:

Download the JAR file to your computer
Copy the file to the mediafiles/other folder on the phone
Go to the Other folder in the File Manager and click Install.
Install to Applications or Games as you see fit.
Run it, it's obvious how you use it.

Technical notes

I've also included the source code Java file below (rename it from .java.txt to .java) for anyone who might be interested.

I used the following code to create the dict.dat file, with the longest words (9 letters) first, and then the shorter words. This is standard Java, not for the mobile phone. The file words-small.txt was made from the SCOWL word list on Kevin's Word List page by selecting only the English and British words and variations, not including the 80 and 95 lists (of very obscure words) to keep the file size down. On unix, you can do this quickly by putting all the lists you want to include in a specific directory, going to that directory and running cat * >../words.txt.

try {
    // output datastream only opened once
    File file= new File("words-small.dat");
    FileOutputStream fos = new FileOutputStream(file);
    DataOutputStream dos=new DataOutputStream(fos);
    String str;
    // for each word length, find all valid words of that length
    for(int i=9;i>=1;i--){
        BufferedReader in = new BufferedReader(new FileReader("words-small.txt"));
        while ((str = in.readLine()) != null) {
            // is it the right length?
            if(str.length()==i){
                // is it valid?
                boolean v=true;
                for(int j=0;j<str.length();j++){
                    if(str.charAt(j)<'a' || str.charAt(j)>'z') v=false;
                }
                if(v) dos.writeUTF(str);
            }
        }
        in.close();
    }
    dos.close();
} catch (IOException e) {}

Using Java DataStream files is a very efficient way to read a JAR resource file on a mobile phone, much better than reading it byte by byte and parsing into strings. The code to then find the words is basically as follows (although see the full source at the bottom of this page if you want to get it running):

InputStream is = getClass().getResourceAsStream("/dict.dat");
if (is == null)
    throw new Exception("File Does Not Exist");
DataInputStream dis = new DataInputStream(is);

int foundwords=0;
stringItemSolution.setText(""); // start off with no found words, we add to this text display
while(dis.available()>0 && foundwords<5){
    String s = dis.readUTF(); // read the next word from the dictionary file
    StringBuffer lb = new StringBuffer(l); // an editable copy of the letters available
    // can we make the string s using the letters available?
    boolean makeable=true;
    for(int i=0;i<s.length() && makeable;i++){
        String sc = s.substring(i,i+1); // the ith letter in the word we're checking
        int j=lb.toString().indexOf(sc); // the index of this letter in the letters still available
        if(j>-1){
            lb.setCharAt(j,' '); // set the letter to ' ' to indicate it's been used up
        } else {
            makeable=false; // j=-1 means the letter we were looking for is not there so we can't make it
        }
    }
    if(makeable){
        // we can make this word
        if(foundwords==0){
            stringItemSolution.setText(s); // add to the list
        } else {
            stringItemSolution.setText(stringItemSolution.getText()+'\n'+s); // add to the list
        }
        foundwords++;
    }
}
dis.close();

Attachment	Size
countdownlettersme.jar	290.26 KB
countdownlettersme.jad	398 bytes
letters.java.txt	9.24 KB

Programming

thesamovar — Tue, 10 Jul 2007 01:55:06 +0100

Not much in the way of programming related stuff at the moment. I have my mobile phone Countdown letters game solver, a Python program to solve the Countdown numbers game, and a portable Javascript Boggle game and solver.

You could also see the software I wrote for my Mathematics PhD thesis.

Maskit

thesamovar — Sun, 15 Oct 2006 04:22:43 +0100

I wrote some software to draw pictures of the Maskit slice, including pleating rays. It allows you to zoom in as far as numerical precision allows, and it has a nice graphical interface (illustrated below). If you're interested in how it works, take a look here. You can export the pictures as postscript files or into Mathematica. You can also export to binary or ASCII format, but I haven't provided any documentation on these. The software runs on Windows, and requires DirectX (which should be installed on almost all versions of Windows now). If you want to try to compile and run this on Linux, let me know. It is possible, but it takes a bit of work and since each version of Linux is different I can't provide a precompiled version. You can download the software here (360k) as a zipped folder.

Maskit software screenshot

Attachment	Size
maskit-distrib.zip	358.92 KB

Programs

thesamovar — Sun, 15 Oct 2006 04:16:49 +0100

As part of my thesis, I wrote some software to draw pictures of the Maskit slice. If you only want to produce pictures of the Maskit slice, you should use the graphical version of this software. The Mathematica notebooks from my thesis can be downloaded here (zipped folder, 40k). Some of these notebooks will work on their own (including all of the algorithms chapter notebook), but some of them require datasets produced by the C++ software. These files are approximately 120MB and too large to include on this webpage, but you can generate them yourself with the C++ software. You can download the C++ source code only distribution here (37k), or with Windows executable files here (161k). I have tested the source code on MS Visual C++ and gcc/Linux. This version of the software only includes the command line version of the software. You can download the graphical version of this software, but compiling this version from the source code is quite complicated. Email me if you want to try this.

Attachment	Size
mathematica-nodata.zip	39.61 KB
hyperbolic-noexe.zip	36.83 KB
hyperbolic.zip	160.22 KB