Mar

15

## APL Hacking: Project Euler Daily (#15)

This was a problem to find all of the forward searching paths in a 20 by 20
grid. This is

1 min read

Mar

15

This was a problem to find all of the forward searching paths in a 20 by 20
grid. This is

1 min read

Mar

14

This problem was interesting in all different ways. It asks for Collatz Sequence
counts. First, I tried to do the

2 min read

Mar

13

So, this is actually my post for Friday, but since I was traveling, I was not
able to post anything

1 min read

Mar

10

This was the first problem that I had to deal with that didn't work right or
quickly if I used

1 min read

Mar

09

I really liked doing this one. I had no idea how to approach this idea at first.
I couldn't think

2 min read

Mar

09

Here is something that I find really entertaining about Ruby:
d/ruby-1.9.1_p430-x86_64-2.txz: Rebuilt.
[note, the

Mar

08

This was a bit of a fun one, since I had trouble trying to get the result into a
32-bit

Mar

07

I have an application that detects and uses the AltGr key by assuming that mod2
is assigned to the AltGr

2 min read

Mar

06

Finally, we get an interesting one. In this problem, I struggled with a desire
to express the solution simply, and

1 min read

Mar

05

Again, this problem was just too easy. I wonder why this one was even given
actually, because in something like

1 min read