Feb
22
2010
By Jonathan Lamothe » 3 Comments
It seems I’ve made some significant progress with the algorithm, just not enough yet.
After some discussion in the comments of my last entry, I decided that my next attempt should be to add a check after every move to make sure that I hadn’t boxed any positions in, making them unreachable.
Read the rest of this entry »
Feb
20
2010
By Jonathan Lamothe » 9 Comments
So, after a talk on IRC with @flying_squirrel (Darcy), I decided to add a progress indicator to the program. This indicator would tell me what estimated percentage of the total number of permutations the program had exhausted and display this information in increments of 1%. As it turns out, this wasn’t very helpful. Let me explain:
Read the rest of this entry »
Feb
20
2010
Yesterday I was presented with an interesting problem. The task was this: write a program that can move a knight from an arbitrary position on a 10×10 chess board (yes, I know they’re usually 8×8) so that it would move to every square on the board but never hit the same position twice.
Read the rest of this entry »
Subscribe to RSS Feed
Follow us on Twitter
Our Mailing Lists
Visit Kwartzlab TV