AgonLight Week Programming Challenge – ISSUE 4

AgonLight Programming challenge is here again! I just wanted to give you some time to rest and refresh for the next round!

As you know we changed the format now you have whole week to solve the problem, not just a weekend!

For these who still didn’t hear about it:

What is WPC?

It’s a small coding challenge that you have to solve for 1 week from Friday 14th of July to Thursday 20th of July.

Who can participate?

Anyone can participate except Olimex employees. You can submit the solutions under your name or anonymously under an alias name.

What are the rules?

The code must run on AgonLight. There are no restriction how you will code your solution: Assembler, Forth, C, BBC Basic, Turbo Pascal for CP/M any tool is possible. If your tool need special installation you should provide brief note how to do it so we can verify your solution.
There is no restriction to re-use code found on internet and adopt it for AgonLight2 as far the code is working and doing the job!
The solutions should be sent to info at olimex dot com. You will receive notification email that the solution is received.

On next Friday 21th of July, we will push all solutions received to a special GitHub repository and announce the winner on Monday 24th of July, who will receive a €50 voucher to use in the Olimex web shop. The jury will consist of Tsvetan Usunov and Bernardo Kastrup.

So z80 retro ninja coders here is the fourth challenge for you!

Make Tetris game for AgonLight in the next 7 days!

https://en.wikipedia.org/wiki/Tetris

Good Luck!

UPDATE-26-07-2023

Three solutions were sent, the winner with the most advanced solution is Lennart Benschop!

You can check them and play here:

https://github.com/OLIMEX/AgonLight-WPC/tree/main/ISSUE-4

AgonLight Week Programming Challenge – ISSUE 3

Here we go to the Third issue of the AgonLight programming challenge.

This time taking into the account the feedback we got from Facebook we will extend it to be 1 week long, not just weekend!

So rules are changed:

What is WPC?

It’s a small coding challenge that you have to solve for 1 week from Friday 2nd of June to Thursday 8th of June!.

Who can participate?

Anyone can participate except Olimex employees. You can submit the solutions under your name or anonymously under an alias name.

What are the rules?

The code must run on AgonLight. There are no restriction how you will code your solution: Assembler, Forth, C, BBC Basic, Turbo Pascal for CP/M any tool is possible. If your tool need special installation you should provide brief note how to do it so we can verify your solution.
There is no restriction to re-use code found on internet and adopt it for AgonLight2 as far the code is working and doing the job!
The solutions should be sent to info at olimex dot com. You will receive notification email that the solution is received.

On next Friday 9th of June, we will push all solutions received to a special GitHub repository and announce the winner on Monday 12th of June, who will receive a €50 voucher to use in the Olimex web shop. The jury will consist of Tsvetan Usunov and Bernardo Kastrup.

So z80 retro ninja coders here is the third challenge for you!

Make Snake game for AgonLight in the next 7 days!

https://en.wikipedia.org/wiki/Snake_(video_game_genre)

Good Luck!

UPDATE: 2023-06-09

The solutions are uploaded on GitHub

UPDATE: 2023-06-12

There are two solutions which are equally good and fun to play: #4 and #8 and as we like them both we decided that this time we will have two winners: Lennart Benschop and Greg Dyke, they both will receive €50 vouchers!

AgonLight Weekend Programming Challenge – ISSUE 2

What is WPC?

It’s a small coding challenge that you have to solve in two days during the weekend.

Who can participate?

Anyone can participate except Olimex employees. You can submit the solutions under your name or anonymously under an alias name.

What are the rules?

The code must run on AgonLight. There are no restriction how you will code your solution: Assembler, Forth, C, BBC Basic, Turbo Pascal for CP/M any tool is possible. If your tool need special installation you should provide brief note how to do it so we can verify your solution.
There is no restriction to re-use code found on internet and adopt it for AgonLight2 as far the code is working and doing the job!
The solutions should be sent to info at olimex dot com. You will receive notification email that the solution is received.

On Monday, we will push all solutions received to a special GitHub repository and announce the winner on Tuesday, who will receive a €50 voucher to use in the Olimex web shop. The jury will consist of Tsvetan Usunov and Bernardo Kastrup.

So z80 retro ninja coders here is the second challenge for you!

Make Flappy Bird game for AgonLight during this weekend!

https://en.wikipedia.org/wiki/Flappy_Bird

According to the Author it took him one weekend to write it 😉

Good Luck!

UPDATE 08-05-2023

With only one single submission we have the ultimate winner LuzrBum:

https://github.com/OLIMEX/AgonLight-WPC/tree/main/ISSUE-2

Weekend – Verilog Programming Challenge – Test your Verilog skills this weekend.

Do you remember WPC (weekend programming challenge). All problems are on GitHub.

I still get e-mail from people asking why we did stop it, the answer is simple: we just ran out of ideas what challenges in programming to ask you.

You guys were so good and for the last challenges I always had impression that we already have solved something like this.

Now you know I have new toys – iCE40 FPGAs and learning Verilog, so I have few ideas for challenge people like me who want to learn Verilog.

Here is our first challenge: Two days ago I posted tutorial how to program VGA video generator and to move one square on the screen with keyboard.

The challenge for this weekend is: modify the code from GitHub to display ball instead of square 🙂

You have time to Monday to solve this and submit your solution to info@olimex.com.

In Monday I will upload all ideas on GitHub and comment.

Have fun!

Weekend Programming Challenge – Week #71 Solutions

We got 3 solutions this weekend!

• C# x1
• Python x1
• C x1

You can browse them on GitHub as usual.

Weekend Programming Challenge – Week #71 Knock Lock

Problem:

Make code which implements knock pattern recognition for door open/close. There must be option to learn knock sequence.

Then every time when this sequence is implemented door lock opens and you signal this.

To simplify the lock we assume between knocks there will be only two intervals short and long.

For instance your code should be able to “learn” this sequence: knock-short-knock-short-knock-long-knock-long-knock-long-knock i.e. three fast and three slow knocks and this to open the door.

For knock detecting you can use SPACE key press for instance.

The rules:

You can code the solution in any programming language during the weekend and have to submit it to info@olimex.com latest on Sunday December 7th.

On Monday we will upload the solutions on GitHub https://github.com/OLIMEX/WPC

You can play with your real name or with nick if you want to be anonymous, we will not disclosure your personal info if you do not want to.

Weekend Programming Challenge – Week #70 Math with Words Solutions

We got 6 solutions this weekend:

• Python x4
• Scheme x1
• C++ x1

All solutions are on GitHub.

Sorry for the late update, but we are working these days on so many exciting and new projects that time is sliping away … 🙂

Weekend Prorgraming Challenge – Week #70 Math with words

Problem:

Make code which enters expression like “3525 + 133 =” and solve it. Easy right? Here is the catch is that numbers and operations are replaced by their words equivalents.

Please support numbers up to 1 000 000 and these operators + – * /

Example:

input: “three thousands five hundreds and twenty five plus one hundred and thirty three is equal to”
output: “3658”

The rules:

You can code the solution in any programming language during the weekend and have to submit it to info@olimex.com latest on Sunday November 30th.

On Monday we will upload the solutions on GitHub https://github.com/OLIMEX/WPC

You can play with your real name or with nick if you want to be anonymous, we will not disclosure your personal info if you do not want to.

Weekend Programmable Challenge – Week #69 – Levenstein distance

We got 7 solutions this weekend:

• Python x2
• C++ x2
• Lisp x1
• Php x1
• C# x1

You can enjoy the solutions on GitHub as usual.

Weekend Programming Challenge – Week #69 Levenshtein Distance

Problem:

Levenshtein Distance  is string metrics for measuring the difference between two sequences. Make code which inputs two strings and calculate Levenshtein Distance between them.

The rules:

You can code the solution in any programming language during the weekend and have to submit it to info@olimex.com latest on Sunday November 18th.

On Monday we will upload the solutions on GitHub https://github.com/OLIMEX/WPC

You can play with your real name or with nick if you want to be anonymous, we will not disclosure your personal info if you do not want to.