flat assembler
Message board for the users of flat assembler.
 Home   FAQ   Search   Register 
 Profile   Log in to check your private messages   Log in 
flat assembler > Projects and Ideas > Contests

Author
Thread Post new topic Reply to topic
KevinN



Joined: 09 Oct 2012
Posts: 161
Contests
I just had an idea about programming contests which would go something like this:

The contest would be: to put together a program/application with a specified function (could be a chess game, tetris game or whatever). The voting system would basically be registered members with 1 vote per member. Voting for a winner entitles the VOTER to some sort of license of the source code of the program. So selection for winner would be decided by what others would want to have a part in.

Example:

Contest for Chess program written in FASM.
All registered board members can select which entry (assuming there are multiple) they would like legal rights to use source code from, but limited to only 1 out of X amount of entries. Whichever project gets the most votes in this way wins some given amount of money designated by sponsor.
Post 23 Feb 2013, 16:35
View user's profile Send private message Reply with quote
Spool



Joined: 08 Jan 2013
Posts: 154
[]


Last edited by Spool on 17 Mar 2013, 10:42; edited 1 time in total
Post 25 Feb 2013, 05:07
View user's profile Send private message Reply with quote
KevinN



Joined: 09 Oct 2012
Posts: 161
http://archive.assembly.org/2012

These guys do asm graphics contests
Post 25 Feb 2013, 12:17
View user's profile Send private message Reply with quote
typedef



Joined: 25 Jul 2010
Posts: 2909
Location: 0x77760000
Post 25 Feb 2013, 13:44
View user's profile Send private message Reply with quote
Dex4u



Joined: 08 Feb 2005
Posts: 1601
Location: web
We used to have a fasm compo
http://board.flatassembler.net/topic.php?t=2164

Entrys http://board.flatassembler.net/topic.php?p=98270#98270

Note: i was called Ashley4 then.
Post 26 Feb 2013, 01:31
View user's profile Send private message Reply with quote
bitRAKE



Joined: 21 Jul 2003
Posts: 2627
Location: dank orb
There are contests out there...

http://azspcs.net/Contest/Factorials/Standings
(seems I've slipped to rank 65)

...just apply FASM where needed.

_________________
The generation of random numbers is too important to be left to chance - Robert R Coveyou
Post 26 Feb 2013, 05:56
View user's profile Send private message Visit poster's website Reply with quote
hopcode



Joined: 04 Mar 2008
Posts: 563
Location: Germany

bitRAKE wrote:
(seems I've slipped to rank 65)


because you start counting at 0 Wink
welcome back, i missed you a lot all this time.
Cheers,
Very Happy

_________________
⠓⠕⠏⠉⠕⠙⠑
Post 26 Feb 2013, 11:47
View user's profile Send private message Visit poster's website Reply with quote
bitRAKE



Joined: 21 Jul 2003
Posts: 2627
Location: dank orb
Thank you for the kind words hopcode. By the looks of your work, you have been busier than I. Wink My health required a break - some serious AFK time.
Post 27 Feb 2013, 00:33
View user's profile Send private message Visit poster's website Reply with quote
bitRAKE



Joined: 21 Jul 2003
Posts: 2627
Location: dank orb
Here is another contest which would be challenging for assembly programmers - Linux environment competing against HLLs.

http://en.wikipedia.org/wiki/ICFP_Programming_Contest

_________________
The generation of random numbers is too important to be left to chance - Robert R Coveyou
Post 04 Mar 2013, 04:23
View user's profile Send private message Visit poster's website Reply with quote
revolution
When all else fails, read the source


Joined: 24 Aug 2004
Posts: 14672
Location: Origae-6
Re: Contests

KevinN wrote:
... wins some given amount of money designated by sponsor.

One wonders who this sponsor might be? If it is just supposed to be some rich and generous anonymous person then it ain't gonna happen.
Post 07 Mar 2013, 07:35
View user's profile Send private message Visit poster's website Reply with quote
nmake



Joined: 13 Sep 2012
Posts: 193
The winners reserve "bragging rights" to claim that their language is "the programming tool of choice for discriminating hackers"

Reserve the bragging rights among the participants, not on a global scale. Important and relevant distinction. Very Happy
Post 12 Mar 2013, 10:08
View user's profile Send private message Reply with quote
sleepsleep



Joined: 05 Oct 2006
Posts: 6405
Location: ˛                              ⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣ Posts: 6699

bitRAKE wrote:
There are contests out there...

http://azspcs.net/Contest/Factorials/Standings
(seems I've slipped to rank 65)

...just apply FASM where needed.



i dont understand the question.
wat is that?
1, 2, 3, 6, -5, -30, 150, 120
Post 12 Mar 2013, 18:42
View user's profile Send private message Reply with quote
comrade



Joined: 16 Jun 2003
Posts: 1104
Location: Russian Federation
From EFnet #asm (back in the day)
http://www.haxor.me.uk/asmcompo/

My best entry was in compo #6 (second place). Funny enough 1st place winner was written in C Smile
Post 13 Mar 2013, 01:47
View user's profile Send private message Visit poster's website AIM Address Yahoo Messenger MSN Messenger ICQ Number Reply with quote
bitRAKE



Joined: 21 Jul 2003
Posts: 2627
Location: dank orb
sleepsleep, from the website:

Quote:
The Task

Given a positive integer n, create a sequence of integers with the following characteristics:
  • The sequence begins with 1.
  • The sequence ends with n! (that is, with n factorial).
  • Each element of the sequence, other than the first, is derivable from two earlier elements through addition, subtraction or multiplication. The two earlier elements need not be distinct. Subtraction can be performed in either direction.
Such a sequence is called a straight line program (SLP) for n!. If it has k+1 elements, it is said to have k steps.

For example, the following is a 7-step SLP for 5!:
    1, 2, 3, 6, -5, -30, 150, 120

As required, each of its elements (other than the first) can be derived from two earlier elements:
    2 = 1 + 1
    3 = 1 + 2
    6 = 3 + 3
    -5 = 1 - 6
    -30 = 6 × -5
    150 = -5 × -30
    120 = -30 + 150

The goal is to find the shortest SLP sequence for 13! through 37!

Algorithm choice is very important. I started out with brute forcing at 13! and then moved to a random sort-of divide-and-conquer approach. It was fast at getting valid SLPs. Noticed some patterns in optimal solutions, and tried to solve a reduced form of the problem. There are just so many approaches that aren't efficient enough...

Here are some additional SLPs:
(Not part of the solution, 1! through 12!)

Code:
1
12
1236
124624
1235824120
12398180720
12363672705040
1236363532115240320
12363672705040362880
123571214472050403628800
1239818077616049280039916800
12481214415223104231003326400479001600


_________________
The generation of random numbers is too important to be left to chance - Robert R Coveyou
Post 21 Mar 2013, 02:58
View user's profile Send private message Visit poster's website Reply with quote
bitRAKE



Joined: 21 Jul 2003
Posts: 2627
Location: dank orb
New contest up at:
http://azspcs.com/Contest/Tetrahedra

Solutions are easy - good solutions are harder.
(Currently, I'm ranked 63, or 18th in USA.)

Kind regards, dear friends.
Post 09 Apr 2016, 18:36
View user's profile Send private message Visit poster's website Reply with quote
Display posts from previous:
Post new topic Reply to topic

Jump to:  


< Last Thread | Next Thread >

Forum Rules:
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You can download files in this forum


Powered by phpBB © 2001-2005 phpBB Group.

Main index   Download   Documentation   Examples   Message board
Copyright © 2004-2016, Tomasz Grysztar.