Category Archives: Programming

Project Euler Problem 7 Solution: Clojure

Problem Description, from Project Euler

What is the n-th prime number?

Problem Solution

This was simple to solve using the Sieve created for the solution to problem #3. To make the program variable, we start with finding all primes less than 1000. If that is not enough to solve the problem, we double this “maximum” value, and search for all primes less than 2000. Rinse, repeat.

The old stuff:

; http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
(defn multiples
    [n]
    (lazy-cat
        [1 n]
        (map
            (fn [a] (+ a n))
            (rest (multiples n))
            )
        )
    )

(defn sieve-of-eratosthenes
    [n]
    ; step 1 Create a list of consecutive integers from two to n: (2, 3, 4, ..., n),
    (defn sieve [rng p]
        ;(print "range: " rng "\n")
        (
            ; this lambda used to perform the actual recursion
            (fn [new-rng]
                ; step #5 Repeat steps 3 and 4 until p^2 is greater than n.
                (if (<= (* p p) n)
                    ; recurse
                    (sieve new-rng
                        ; step # 4 Find the first number remaining on the list after p
                        ; (it's the next prime); let p equal this number,
                        (first (filter #(> % p) new-rng))
                        )
                    ; end recursion otherwise
                    new-rng
                    )
                )
            ; this is an argument to the lambda above
            ; step #3 While enumerating all multiples of p starting from p2,
            ; strike them off from the original list,
            (filter
                #(or
                    (not= ; divisible by p
                        (rem % p)
                        0
                        )
                    ; greater than p^2
                    (< % (* p p))
                    )
                    rng
                )
            )
        )

    (sieve
        (range 2 n)
        2 ; step #2 Initially, let p equal 2, the first prime number
        )
    )

The new stuff:

(defn problem07 [nth]
    (defn try-find-nth-prime [primes max-number]
        (if (< (count primes) nth)
            ; if the list of primes is not long enough,
            ; double the maximum search number
            (try-find-nth-prime
                (sieve-of-eratosthenes (* max-number 2))
                (* max-number 2)
                )
            ; otherwise, take the nth member of the list
            (last (take nth primes))
            )            

        )
    (try-find-nth-prime (sieve-of-eratosthenes 1000) 1000)
    )

Sql Cross Apply

I found out about a feature in SQL Server 2005 I didn’t know about (having come from a SQL Server 2000 shop). Cross Apply! It’s for when you want to feed the value of a table row into a function and join on the results. This is different than a cross join, because you cannot pass a table column value into a function when you do a cross join.

I whipped up a simple example. Let’s say we want the states that state with a certain letter (this is a trivial example because we could do this with a simple query as well). 

select *
from letters
cross apply dbo.get_StateByFirstLetter ( letters.letter )
where letters.letter between 'L' and 'M'

-- equivalent to
select * from dbo.get_StateByFirstLetter ( 'L' )
UNION
select * from dbo.get_StateByFirstLetter ( 'M' )

-- equivalent to (which makes the above trivial)
select * from [states]
where left(state_name, 1) between 'L' and 'M'

Full script to setup everything (pardon the sloppiness)

-- setup the states table
CREATE TABLE [states] (
	state_name varchar(25),
	state_abbr char(2)
)

INSERT INTO states VALUES ('Alaska', 'AK');
INSERT INTO states VALUES ('Alabama', 'AL');
INSERT INTO states VALUES ('American Samoa', 'AS');
INSERT INTO states VALUES ('Arizona', 'AZ');
INSERT INTO states VALUES ('Arkansas', 'AR');
INSERT INTO states VALUES ('California', 'CA');
INSERT INTO states VALUES ('Colorado', 'CO');
INSERT INTO states VALUES ('Connecticut', 'CT');
INSERT INTO states VALUES ('Delaware', 'DE');
INSERT INTO states VALUES ('District of Columbia', 'DC');
INSERT INTO states VALUES ('Florida', 'FL');
INSERT INTO states VALUES ('Georgia', 'GA');
INSERT INTO states VALUES ('Guam', 'GU');
INSERT INTO states VALUES ('Hawaii', 'HI');
INSERT INTO states VALUES ('Idaho', 'ID');
INSERT INTO states VALUES ('Illinois', 'IL');
INSERT INTO states VALUES ('Indiana', 'IN');
INSERT INTO states VALUES ('Iowa', 'IA');
INSERT INTO states VALUES ('Kansas', 'KS');
INSERT INTO states VALUES ('Kentucky', 'KY');
INSERT INTO states VALUES ('Louisiana', 'LA');
INSERT INTO states VALUES ('Maine', 'ME');
INSERT INTO states VALUES ('Marshall Islands', 'MH');
INSERT INTO states VALUES ('Maryland', 'MD');
INSERT INTO states VALUES ('Massachusetts', 'MA');
INSERT INTO states VALUES ('Michigan', 'MI');
INSERT INTO states VALUES ('Minnesota', 'MN');
INSERT INTO states VALUES ('Mississippi', 'MS');
INSERT INTO states VALUES ('Missouri', 'MO');
INSERT INTO states VALUES ('Montana', 'MT');
INSERT INTO states VALUES ('Nebraska', 'NE');
INSERT INTO states VALUES ('Nevada', 'NV');
INSERT INTO states VALUES ('New Hampshire', 'NH');
INSERT INTO states VALUES ('New Jersey', 'NJ');
INSERT INTO states VALUES ('New Mexico', 'NM');
INSERT INTO states VALUES ('New York', 'NY');
INSERT INTO states VALUES ('North Carolina', 'NC');
INSERT INTO states VALUES ('North Dakota', 'ND');
INSERT INTO states VALUES ('Ohio', 'OH');
INSERT INTO states VALUES ('Oklahoma', 'OK');
INSERT INTO states VALUES ('Oregon', 'OR');
INSERT INTO states VALUES ('Palau', 'PW');
INSERT INTO states VALUES ('Pennsylvania', 'PA');
INSERT INTO states VALUES ('Puerto Rico', 'PR');
INSERT INTO states VALUES ('Rhode Island', 'RI');
INSERT INTO states VALUES ('South Carolina', 'SC');
INSERT INTO states VALUES ('South Dakota', 'SD');
INSERT INTO states VALUES ('Tennessee', 'TN');
INSERT INTO states VALUES ('Texas', 'TX');
INSERT INTO states VALUES ('Utah', 'UT');
INSERT INTO states VALUES ('Vermont', 'VT');
INSERT INTO states VALUES ('Virgin Islands', 'VI');
INSERT INTO states VALUES ('Virginia', 'VA');
INSERT INTO states VALUES ('Washington', 'WA');
INSERT INTO states VALUES ('West Virginia', 'WV');
INSERT INTO states VALUES ('Wisconsin', 'WI');
INSERT INTO states VALUES ('Wyoming', 'WY');
GO

-- create the function which we are applying
create function dbo.get_StateByFirstLetter(@firstLetter char(1))
RETURNS @rtn TABLE (
	state_name varchar(25),
	state_abbr char(2)
)
AS
bEGIN
	insert into @rtn
	select state_name, state_abbr from states where left(state_name,1) = @firstLetter
	return
END
GO

-- generate letters table
create table letters ( letter char(1) PRIMARY KEY )
with gen_letters as
(
	select 65 as ascii_val
	UNION ALL
	SELECT ascii_val + 1 from gen_letters where ascii_val + 1 <= 90
)
insert into letters
select char(ascii_val) from gen_letters 

-- get results by cross applying
select *
from letters
cross apply dbo.get_StateByFirstLetter ( letters.letter )
where letters.letter between 'L' and 'M'

-- equivalent to
select * from dbo.get_StateByFirstLetter ( 'L' )
UNION
select * from dbo.get_StateByFirstLetter ( 'M' )

And for good measure, using the WITH clause to generate a table of letters:

with gen_letters as
(
	select 65 as ascii_val
	UNION ALL
	SELECT ascii_val + 1 from gen_letters where ascii_val + 1 <= 90
)
insert into letters select char(ascii_val) from gen_letters

Project Euler Problem 4 Solution: Clojure

Problem Description, from Project Euler

Find the largest palindrome made from the product of two 3-digit numbers

Solution

I couldn’t think of many optimizations for this problem, other than avoiding duplicates when calculating the products of numbers. That’s why I just brute-forced it. The only (barely) interesting thing I did here was to write a function which recognized palindromes. Thinking about the problem now, I suppose we can predict whether the first and last digits of a product will be the same by looking at the hundreds and tens digits of the factors.


; flattens a nested list
(defn flatten [x] (let [s? #(instance? clojure.lang.Sequential %)] (filter (complement s?) (tree-seq s? seq x))))

(defn palindrome? [s]
    (if (or
        ; all 1 letter strings or
        ; nils are palindromes
        (<= (count s) 1)
        (nil? s)
        )
        true
        (and
            (= (first s) (last s))
            (palindrome? (take (- (count s) 2) (rest s)))
            )
        )
    )
(defn problem04 []
    (def x (range 100 1000))
    ; sort, then take the last
    (last (sort
        ; filter to only palindromes
        (filter
            #(palindrome? (str %))
            ; distinct products of all 3-digit numbers
            (distinct (flatten
                (map
                    (fn [n]
                        (map (fn [a] (* a n)) x))
                    x
                    )
                ))
            )
        ))
    )

Project Euler Problem 3 Solution: Clojure

Problem description, from Project Euler

What is the largest prime factor of the number N?

Solution

In previous problems, I was using a list of primes I got somewhere else. I figured it would be relevant to implement a prime-finding algorithm. I decided to go with simplicity, and implement the Sieve of Eratosthenes. It’s basically the algorithm you would come up with yourself if you wanted to figure out how to find all the prime numbers within a certain range.

Say we want to find all the prime numbers between 1 and 100. Start with the first prime number 2. Remove from the list all multiples of 2. Work with the next prime number 3. Remove from the list all multiples of 3. Continue until the square number you pick is greater than the last number in the list. This is because no number after that will have a multiple in the list.

For the part where we factor primes, I used the algorithm I came up with for problem 5, even though it is inelegant and has a kludgy fix.

Overall, I was happy with my solution. I think I am beginning to think more “functionally.”

; flattens a nested list
(defn flatten [x] (let [s? #(instance? clojure.lang.Sequential %)] (filter (complement s?) (tree-seq s? seq x))))

; http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
(defn sieve-of-eratosthenes
    [n]
    (defn sieve-of-eratosthenes-helper
        [n]
        ; step 1 Create a list of consecutive integers from two to n: (2, 3, 4, ..., n),

        (defn sieve [rng p]
            (
                ; this lambda used to perform the actual recursion
                (fn [new-rng]
                    ; step #5 Repeat steps 3 and 4 until p^2 is greater than n.
                    (if (<= (* p p) n)
                        ; recurse
                        (sieve new-rng
                            ; step # 4 Find the first number remaining on the list after p
                            ; (it's the next prime); let p equal this number,
                            (first (filter #(> % p) new-rng))
                            )
                        ; end recursion otherwise
                        new-rng
                        )
                    )
                ; this is an argument to the lambda above
                ; step #3 While enumerating all multiples of p starting from p2,
                ; strike them off from the original list,
                (filter
                    #(or
                        (not= ; divisible by p
                            (rem % p)
                            0
                            )
                        ; greater than p^2
                        (< % (* p p))
                        )
                        rng
                    )
                )
            )

        (sieve
            (range 2 n)
            2 ; step #2 Initially, let p equal 2, the first prime number
            )
        )

    (sieve-of-eratosthenes-helper n)
    )

(defn problem03 [n]
    ; begin by generating primes below the sqrt of the number.
    ; I'm just guessing this will be good enough. I started
    ; with a guess of 1000, which was woefully small
    (def prime-cache (sieve-of-eratosthenes (. java.lang.Math (sqrt n))))
    (defn prime?
        [n]
        (not (nil? (some #(= n %) prime-cache)))
        )
    ; prime-factorization algorithm from solving previous
    ; project Euler problems such as #5
    (defn prime-factorization
        [n]
        (defn pf-helper
            []
            (def first-divisible
                (first (filter
                    #(zero?
                        (rem n %)
                        )
                    (rest prime-cache))
                    )
                )

            (def result (/ n first-divisible))

            (def new-result
                (if (not (prime? result))
                    (prime-factorization result)
                    [result]
                    )
                )

            ; i don't know why I need to set this again.
            ; the recursion seems to mutate a value that
            ; should not be in its scope
            (def first-divisible
                (first (filter
                    #(zero?
                        (rem n %)
                        )
                    (rest prime-cache))
                    )
                )

            (if (nil? new-result)
                nil
                (if (nil? first-divisible)
                    [new-result]
                    (flatten [new-result first-divisible])
                    )
                )
            )

        (if (prime? n)
            [n]
            (pf-helper)
            )
        )

    ; factor!
    (prime-factorization n)

    )

Project Euler Problem 6 Solution: Clojure

Problem description, from Project Euler

Find the difference between the sum of the squares of the first N natural numbers and the square of the sum.

Solution

This one actually seemed to be easier than the others. No filters required!

    (defn problem06
        [upper]
        (defn sq [n] (* n n))
        (def l (range 1 (+ upper 1)))
        (-
            (sq (reduce + l))
            (reduce + (map sq l))
            )
        )

The biggest hangup I had was that when I originally read the problem, I thought I’d need a power function, and then spent at least 15 minutes determining there was no Clojure core power function. I found some alternatives here:


     ; for integers (cuz it's faster)
     (. (. java.math.BigInteger (valueOf 2)) (pow 5))
     ; for doubles
     (. java.lang.Math (pow 2 -3))

Project Euler Problem 5 Solution: Clojure

Problem description, from Project Euler

What is the smallest number that is evenly divisible by all of the numbers from 1 to N?

Solution

The math

Basically, we are finding the least common multiple (LCM) of the numbers (grade school math?). This can be done by generating the prime factors of each of the numbers. Once the factorization is complete, determine the greatest number of times a prime appears in any number. For example, the prime factors of 16 are (2,2,2,2) and of 20 are (2,2,5). 2 appears at most 4 times in numbers from 1-20, so we stick with (2,2,2,2). Repeat for all prime factors of the numbers 1 through 20.

An alternative way to think about this, is to list all the greatest powers of primes below 20, and find the product of these.
2^4 * 3^2 * 5 * 7 * 11 * 13 * 17 * 19. Doing it this way in the program would be quicker, but I decided to factor each number.

My first attempt

This solution is UGLY! For one, I hardcoded a list of primes. I do not yet know how to generate a list of primes quickly for arbitrary N, although I believe that will be required for future Euler problems (and Google will tell me how to do so).

Also, the structure of the program doesn’t seem truly functional to me. I may amend this post with a revision later. I did learn a number of great things in this including:

  • How to flatten a sequence using tree-seq
  • Working with hash maps

The biggest headache was the prime-factorization function, which I probably could’ve written in another language in 15-30 minutes. Instead, it took me maybe 6 hours to get the algorithm right, and I had to use a weird hack. I think I have some misunderstanding about the scope of a def call. I’m sure the topic will become illuminated as I proceed.

(defn problem05
    [upper]

    (defn flatten [x] (let [s? #(instance? clojure.lang.Sequential %)] (filter (complement s?) (tree-seq s? seq x)))) 

    ; cheated by using a list of primes. could be replaced by implementation of sieve of eratosthenes from problem 7
    ; http://www.math.utah.edu/~pa/math/primelist.html
    (def prime-cache [1 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659 661 673 677 683 691 701 709 719 727 733 739 743 751 757 761 769 773 787 797 809 811 821 823 827 829 839 853 857 859 863 877 881 883 887 907 911 919 929 937 941 947 953 967 971 977 983 991 997 1009 1013 1019 1021 1031 1033 1039 1049 1051 1061 1063 1069 1087 1091 1093 1097 1103 1109 1117 1123 1129 1151 1153 1163 1171 1181 1187 1193 1201 1213 1217 1223 1229 1231 1237 1249 1259 1277 1279 1283 1289 1291 1297 1301 1303 1307 1319 1321 1327 1361 1367 1373 1381 1399 1409 1423 1427 1429 1433 1439 1447 1451 1453 1459 1471 1481 1483 1487 1489 1493 1499 1511 1523 1531 1543 1549 1553 1559 1567 1571 1579 1583 1597 1601 1607 1609 1613 1619 1621 1627 1637 1657 1663 1667 1669 1693 1697 1699 1709 1721 1723 1733 1741 1747 1753 1759 1777 1783 1787 1789 1801 1811 1823 1831 1847 1861 1867 1871 1873 1877 1879 1889 1901 1907 1913 1931 1933 1949 1951 1973 1979 1987 1993 1997 1999 2003 2011 2017 2027 2029 2039 2053 2063 2069 2081 2083 2087 2089 2099 2111 2113 2129 2131 2137 2141 2143 2153 2161 2179 2203 2207 2213 2221 2237 2239 2243 2251 2267 2269 2273 2281 2287 2293 2297 2309 2311 2333 2339 2341 2347 2351 2357 2371 2377 2381 2383 2389 2393 2399 2411 2417 2423 2437 2441 2447 2459 2467 2473 2477 2503 2521 2531 2539 2543 2549 2551 2557 2579 2591 2593 2609 2617 2621 2633 2647 2657 2659 2663 2671 2677 2683 2687 2689 2693 2699 2707 2711 2713 2719 2729 2731 2741 2749 2753 2767 2777 2789 2791 2797 2801 2803 2819 2833 2837 2843 2851 2857 2861 2879 2887 2897 2903 2909 2917 2927 2939 2953 2957 2963 2969 2971 2999 3001 3011 3019 3023 3037 3041 3049 3061 3067 3079 3083 3089 3109 3119 3121 3137 3163 3167 3169 3181 3187 3191 3203 3209 3217 3221 3229 3251 3253 3257 3259 3271 3299 3301 3307 3313 3319 3323 3329 3331 3343 3347 3359 3361 3371 3373 3389 3391 3407 3413 3433 3449 3457 3461 3463 3467 3469 3491 3499 3511 3517 3527 3529 3533 3539 3541 3547 3557 3559 3571 3581 3583 3593 3607 3613 3617 3623 3631 3637 3643 3659 3671 3673 3677 3691 3697 3701 3709 3719 3727 3733 3739 3761 3767 3769 3779 3793 3797 3803 3821 3823 3833 3847 3851 3853 3863 3877 3881 3889 3907 3911 3917 3919 3923 3929 3931 3943 3947 3967 3989 4001 4003 4007 4013 4019 4021 4027 4049])

    ; return primes below a certain number
    (defn primes
        [max-prime]
        ; we should actually have code to add to
        ; the prime cache, but it's not necessary
        ; to solve the problem
        (filter #(< % max-prime) prime-cache)
        )
    ; determines whether or not a number is a prime number
    (defn prime?
        [n]
        (not (nil? (some #(= n %) prime-cache)))
        )
    (defn prime-factorization
        [n]
        (defn pf-helper
            []
            (def first-divisible
                (first (filter
                    #(zero?
                        (rem n %)
                        )
                    (rest (primes n)))
                    )
                )
            ;(print "first-divisible: " first-divisible "\n")

            (def result (/ n first-divisible))
            ;(print "result: " result "\n")

            (def new-result
                (if (not (prime? result))
                    (prime-factorization result)
                    [result]
                    )
                )
            ;(print "new-result:" new-result "\n")
            ; i don't know why I need to set this again.
            ; the recursion seems to mutate a value that
            ; should not be in its scope
            (def first-divisible
                (first (filter
                    #(zero?
                        (rem n %)
                        )
                    (rest (primes n)))
                    )
                )
            (if (nil? new-result)
                nil
                (if (nil? first-divisible)
                    [new-result]
                    (flatten [new-result first-divisible])
                    )
                )
            )

        (if (prime? n)
            [n]
            (pf-helper)
            )
        )

    ; will return a hash where each list member is
    ; a key and the values are the count of the occurences
    ; of the member in the list
    (defn cnt-hash
        [haystack]
        (if (nil? haystack)
            {}
            ; increment the value in the hash
            (
                ; tail recursion?
                (def store (cnt-hash (rest haystack)))
                (def needle (first haystack))
                (assoc store needle
                    (if (contains? store needle)
                        (inc (get store needle))
                        1
                        )
                    )
                )
            )
        )
    ; looks at each list and returns the maximum
    ; number of occurences of each element in each
    ; list
    (defn list-max-occurences
        [l]
        (defn helper-reduce
            [h1 h2]
            (merge-with
                ; merges and returns the larger value
                ; if there is a key conflict
                (fn [a b] (if (> a b) a b))
                h1
                h2
                )
            )
        (reduce
            helper-reduce
            (map cnt-hash l)
            )
        )

    (def occurences
        (list-max-occurences
            ; returns a list of lists of prime-factors
            ; of the numbers between 1 and upper
            (map prime-factorization (range 1 (+ 1 upper)))
            )
        )

    ; returns the result of multiplying each key with its value
    (def products
        (map
            (fn [k] (. (. java.math.BigInteger (valueOf k)) (pow (get occurences k)))) ;(. java.lang.Math (pow k (get occurences k)))); (* k (get occurences k)))
            (keys occurences)
            )
        )
    (reduce * products)
)

I’m still not using the most current version of Clojure, so I may be rewriting functions which already exist.

Project Euler Problem 2 Solution: Clojure

Problem 2 Description, from Project Euler

Find the sum of all the even-valued terms in the Fibonacci sequence which do not exceed four million.

Solutions

My first attempt

The trickiest thing for me was figuring out how to write the fibonacci function in an elegant way. I know that with functional languages, recursion is supposed to be super elegant, and my solution was anything but.

    (defn problem02
        []
        (defn fib
            [termCount]
            (defn fib-help
                [termCount, terms]
                (def rterms (reverse terms))
                (def lst (first rterms))
                (def nlst (first (rest rterms)))
                (if (< (count terms) termCount)
                    (fib-help
                        termCount
                        (reverse (cons (+ lst nlst) rterms))
                        )
                    terms
                    )
                )
            (fib-help termCount, `(1, 2))
            )
        (reduce + (filter
            #(and
                (< % 4000000)
                (even? %)
                )
            (fib 200)
            ))

    )
    (problem02)

A solution by another person

The [site I linked to in the previous article](http://grok-code.com/367/learning-clojure-with-project-euler/) as a much more elegant solution. I really had trouble figuring out how to do an elegant Fibonacci algorithm, although I knew that mine was inelegant!

   (defn e2 [limit]
     (let [fibs2 (lazy-cat [0 1]
                           (map + fibs2 (rest fibs2)))]
       (reduce + (filter #(zero? (mod % 2))
                         (take-while #(< % limit) fibs2)))))

I love the user of *lazy-cat*. I was trying to search for how to do this, but wasn’t sure what this was called. I only knew that the *iterate* function used something like this (I guess I could’ve checked it’s source). I find the use of map interesting, but confusing because it seems as if *fibs2* would return a list and that there should somehow be duplicate values in that list. I’m sure I will come to understand more later.

Project Euler Problem 1 Solution: Clojure

After PhillyETE, I wanted to try out some Clojure, so I decided to solve the first problem of Project Euler. I coded up my own solution using some of the references on the Clojure site.

Project Euler Problem Description, from Project Euler

Find the sum of all the multiples of 3 or 5 below N.
(N is 1000 is this Project Euler problem.)

Solutions

My first attempt

    (def nmbrs (range 0 1000))
    (def multiples
        (filter
            #(and
                (not= % 0)
                (or
                    (=
                        (rem % 3)
                        0
                        )
                    (=
                        (rem % 5)
                        0
                        )
                    )
                )
            nmbrs
            )
        )
    (reduce + multiples)

Another attempt by a different author

Afterwards, I came across a terser, more elegant solution on a site that seems to have had the same idea as I did, Learning Clojure with Project Euler. The site had a really elegant looking solution:

    ; http://grok-code.com/367/learning-clojure-with-project-euler/
    (defn problem01 [limit]
     (reduce + (filter #(or (zero? (mod % 3))
                            (zero? (mod % 5)))
                       (take (- limit 1) (iterate inc 1)))))
    (problem 1000)

My revised attempt

The use of take and iterate are really interesting. I haven’t encountered these “lazy” functions, and was surprised when I tried to run (iterate inc 1) in the REPL. I decided to modify my version with some of the things I learned from the version above, and make it more terse.

    (defn problem01
        [upper]
        (reduce +
            (filter
                #(or
                    (zero?(rem % 3))
                    (zero?(rem % 5))
                    )
                (range 1 upper)
                ))
        )

I’ll be working on some more of the problems in the coming days.

(PS. If you are wondering why I use rem instead of mod, it’s because I am using an older version of clojure with TextMate–I’ve yet to upgrade)

Word Jumble Game: Part 5

I used jQuery for the UI. I am a recent convert to jQuery, having mostly used Prototype + Scriptaculous.

The word list is embedded into the page script as a javascript array. On document ready, html is generated, which writes the first and last word to the page, and creates blank input boxes for the intermediate words.

There is a keyup event bound on each input box, which will determine if the word is correct. If it is, a css class will be added which shows a green underline underneath the box. Otherwise, a red underline will be shown.

Finally, there are buttons on the page which are created dynamically and provides hints or reveal all of the answers.

Word Jumble Filled

Word Jumble Filled

Word Jumble Game: Part 4

Search

The problem of generating the chain of clues is a simple search problem. In this case, depth-first search was used, because the algorithm would attempt path depth-wise and only explore another branch if the generated chain was not long enough.

Another tactic would have been to use a breadth first search. To use breadth-first search, we could have modified the regex pattern to find all words that differed from the base word by just one letter.

Using water as the base word, that regular expression looks something like: /([^w]ater|w[^a]ter|wa[^t]er|wat[^e]r|wate[^r])/. This would find all words in the dictionary that differed by one word (let’s call this word set B).

If we were using breadth-first search, we would then repeat the process with all of the words we just found (word set B).

If you were to visualize the difference between breadth-first and depth-first search, breadth-first would look like a tree with wide but shallow roots. Depth-first search would look like a tree with few but deep roots.

Query Params

The flexibility of the puzzle is enhanced by optional query parameters that may be applied. The word param allows specification of the starting or seed word. The length param specifies the maximum length of the puzzle.

Recursion

The program uses recursion to perform the search. This almost goes without saying, for it is difficult to do general search without recursion (although you could do so with macros and similar programming constructs). Search may be done using loop control structures but I can’t imagine an elegant solution using loops.

The pseudocode for the recursion is basically:

function build(baseWord, chainWords, maxLength)

    regex = generateRandomRegex(baseWord)
    wordSetB = getPossibleWords(regex, notIn=chainWords)
    for(word in wordSetB)

        chain = build(word, chainWords+word, maxLength)
        if Length(chain) >= maxLength

            break

    return chain