To celebrate 1 year of no new challenges, here's a nicely difficult one for you - Visit it at Guns And Zips.

It's not quite a record given it's been only 217 days since Choose was added to the site, but we have a new challenge for you.

The challenge involves representing a time given in digital format (ie, hh:mm) on an analogue-style clock face. As usual, the challenge description gives you all the information you require - Visit it at .

Thanks go to Arpad Ray for sending in this challenge.

It's not quite a record given it's been only 217 days since Choose was added to the site, but we have a new challenge for you.

The challenge involves representing a time given in digital format (ie, hh:mm) on an analogue-style clock face. As usual, the challenge description gives you all the information you require - Visit it at .

Thanks go to Arpad Ray for sending in this challenge.

We had planned to release this challenge a little earlier than this, but with the holidays and all, it got a little delayed.

The challenge asks you to calculate how many different ways you can pick a certain number of items from a larger set of those items. Don’t be scared off if you don’t know how to do this, all the information you need is in the challenge description. Visit the Choose challenge page.

Thanks go to Flagitious for sending in this challenge.

Something that might be of interest to you Code Golfers – Flagitious recently created a language called GolfScript. which was designed specifically to be good for golfing. Please visit the site and have a look.

To give you an idea of how good it is, this challenge can be solved in 21 bytes in GolfScript, which he estimates being half the size of what the winning submission on Code Golf will be!

Wow, it only seems like 236 yesterdays ago when we added the Tower of Hanoi challenge!

But here you are – Something new to play with. It’s a nice and simple one, involving finding the row or column in a grid of numbers which has the highest aggregate total. Read all about it on the Grid Computing challenge page, where you’ll see all the information you need.

Thanks to Ciaran Walsh for submitting the challenge.

So, how long until the next challenge you might ask? Who knows, but I’m pretty sure it’s going to land in less than 237 days.

Wow, it only seems like 236 yesterdays ago when we added the Tower of Hanoi challenge!

But here you are – Something new to play with. It’s a nice and simple one, involving finding the row or column in a grid of numbers which has the highest aggregate total. Read all about it on the Grid Computing challenge page, where you’ll see all the information you need.

Thanks to Ciaran Walsh for submitting the challenge.

So, how long until the next challenge you might ask? Who knows, but I’m pretty sure it’s going to land in less than 237 days.

To celebrate the first Friday the 13th of 2007, we have a new challenge for you kerrrazy golfers. I’m sure most of you have heard of the Tower of Hanoi. This challenge requires you to take a starting position of the puzzle and organise the pegs onto one peg. Read all about it on the Tower of Hanoi challenge page, where you’ll see all the information you need.

I’m going to make the bold promise that we’ll have a new challenge next Friday, but I’ve said that before so we’ll see if it actually happens!

To celebrate the first Friday the 13th of 2007, we have a new challenge for you kerrrazy golfers. I’m sure most of you have heard of the Tower of Hanoi. This challenge requires you to take a starting position of the puzzle and organise the pegs onto one peg. Read all about it on the Tower of Hanoi challenge page, where you’ll see all the information you need.

I’m going to make the bold promise that we’ll have a new challenge next Friday, but I’ve said that before so we’ll see if it actually happens!

It’s been more than a month since the last challenge, many apologies for the delay in posting a new challenge. So let’s hope you like it!

Musical Score asks you to parse a music score and output the notes which are represented on it. In my opinion, it’s quite an interesting problem. As usual, visit the challenge’s page to see the full details.

We’re hoping it won’t be anywhere near as long until the next challenge, and there have been a few interesting challenges posted on the forums. If you have any suggestions, you can post them there, or email me them at the address at the bottom of each Code Golf page.

It’s been more than a month since the last challenge, many apologies for the delay in posting a new challenge. So let’s hope you like it!

Musical Score asks you to parse a music score and output the notes which are represented on it. In my opinion, it’s quite an interesting problem. As usual, visit the challenge’s page to see the full details.

We’re hoping it won’t be anywhere near as long until the next challenge, and there have been a few interesting challenges posted on the forums. If you have any suggestions, you can post them there, or email me them at the address at the bottom of each Code Golf page.

A quick note to let you all know that there will be roughly 30 minutes downtime from about 16:30 GMT tomorrow (Tuesday) afternoon for some essential server upgrades. During that period the Code Golf server will be completely unavailable.

A quick note to let you all know that there will be roughly 30 minutes downtime from about 16:30 GMT tomorrow (Tuesday) afternoon for some essential server upgrades. During that period the Code Golf server will be completely unavailable.

A new challenge has arrived in the shape of ‘Roman to Decimal’. The problem is exactly as it sounds – Your code will be given some Roman numerals, and it will have to convert them to the system we’re all more familiar with.

There are 25 test cases, so hopefully there won’t be any luck-based submissions for this challenge!

Thanks must go to Flagitious for putting this challenge together, as well as writing the description. Good work man!

A new challenge has arrived in the shape of ‘Roman to Decimal’. The problem is exactly as it sounds – Your code will be given some Roman numerals, and it will have to convert them to the system we’re all more familiar with.

There are 25 test cases, so hopefully there won’t be any luck-based submissions for this challenge!

Thanks must go to Flagitious for putting this challenge together, as well as writing the description. Good work man!

For those people who thought that Polynomial Division was too difficult, we have a nice and easy one for you this week. Given co-ordinates and the ASCII values of characters, you have to produce the piece of art that they describe. All the details are available on the Bob Ross’ The Joy of ASCII Art challenge page.

Code Golf user and resident #codegolf comedian Ciaran submitted this one, thanks Ciaran!

For those people who thought that Polynomial Division was too difficult, we have a nice and easy one for you this week. Given co-ordinates and the ASCII values of characters, you have to produce the piece of art that they describe. All the details are available on the Bob Ross’ The Joy of ASCII Art challenge page.

Code Golf user and resident #codegolf comedian Ciaran submitted this one, thanks Ciaran!

I know, I know, I slacked off over Christmas and New Year but FINALLY I’ve sorted out a new challenge for you to play with.

Polynomial Division was suggested and submitted by Flagitious, who’s currently our #1 golfer and hangs out in the #codegolf IRC channel. Thanks Flagitious!

The idea is that you take two polynomials and divide them. The actual division process isn’t too complicated, but actually coding it isn’t what I’d call trivial. As usual, the challenge page contains much more information. I’m sure you’ll all have fun with it!

I have two or three other challenges that have been submitted recently, I might release one of the simpler ones later this week depending on how the submissions for the above challenge go. Either way, we shouldn’t have to wait weeks until the next challenge!

I know, I know, I slacked off over Christmas and New Year but FINALLY I’ve sorted out a new challenge for you to play with.

Polynomial Division was suggested and submitted by Flagitious, who’s currently our #1 golfer and hangs out in the #codegolf IRC channel. Thanks Flagitious!

The idea is that you take two polynomials and divide them. The actual division process isn’t too complicated, but actually coding it isn’t what I’d call trivial. As usual, the challenge page contains much more information. I’m sure you’ll all have fun with it!

I have two or three other challenges that have been submitted recently, I might release one of the simpler ones later this week depending on how the submissions for the above challenge go. Either way, we shouldn’t have to wait weeks until the next challenge!

As previously mentioned, Python and PHP used to have access to a zlib module which made it trivial to compress programs written in those languages. In addition to this, Python has zip and bz2 codecs which also allowed trivial compression.

The Python and PHP entries which used these modules have now been marked as failed, and the various leaderboards now reflect the updated scores.

If you have previously submitted an entry which used these modules and it is still marked as passed, please let us know. Either email us or post in the forums and we’ll sort it out for you.

Thanks for everyone’s understanding, especially Mark Byers, who was 4th and has now dropped out of the top 10. Sorry Mark!

As previously mentioned, Python and PHP used to have access to a zlib module which made it trivial to compress programs written in those languages. In addition to this, Python has zip and bz2 codecs which also allowed trivial compression.

The Python and PHP entries which used these modules have now been marked as failed, and the various leaderboards now reflect the updated scores.

If you have previously submitted an entry which used these modules and it is still marked as passed, please let us know. Either email us or post in the forums and we’ll sort it out for you.

Thanks for everyone’s understanding, especially Mark Byers, who was 4th and has now dropped out of the top 10. Sorry Mark!