From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=unavailable autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!feeder.eternal-september.org!news.linkpendium.com!news.linkpendium.com!news.snarked.org!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!buffer1.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail NNTP-Posting-Date: Fri, 29 Mar 2019 12:35:24 -0500 From: Dennis Lee Bieber Newsgroups: comp.lang.ada Subject: Re: Make with Ada 2019 : DogRobot Date: Fri, 29 Mar 2019 13:35:25 -0400 Organization: IISS Elusive Unicorn Message-ID: <1als9e10rgq9i3cc9mso086pu5k3gb6v9s@4ax.com> References: <6b918556-b1ff-4cf9-a5c7-d5fd9b5b72c6@googlegroups.com> <1a40fad3-ff41-4fce-b6df-3378ea0a67a2@googlegroups.com> <933939df-09ec-4a0f-aa83-8a639cf62372@googlegroups.com> User-Agent: ForteAgent/8.00.32.1272 X-No-Archive: YES MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Usenet-Provider: http://www.giganews.com X-Trace: sv3-CPF49pXxCEXINH+TwJQzCn/ekCjNsdidnGMzetsOnIOm6cFZJ7LxVWnqzE3PHPDwkH5BRlmhTZlVxSR!vCXcG1eVW/89bShzJDrZqIKQTyAeoHLdXMMWi517QWtYkSUjcwYkpZjNlzhUY8et99hdryRC X-Complaints-To: abuse@giganews.com X-DMCA-Notifications: http://www.giganews.com/info/dmca.html X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly X-Postfilter: 1.3.40 X-Original-Bytes: 2988 Xref: reader01.eternal-september.org comp.lang.ada:55998 Date: 2019-03-29T13:35:25-04:00 List-Id: On Fri, 29 Mar 2019 04:36:59 -0700 (PDT), fabien.chouteau@gmail.com declaimed the following: > >For the Make with Ada competitions we never had a criteria on the complexity of the problem addressed, the complexity of the solution, the number of lines of code or anything of that nature. The intent was to have the competition open to everyone, including beginners. >The result is that the focus is more on how well you explain your project than the complexity of the project itself. > >This worked well for us in the first two editions, so we kept it that way for the third. > >We are open to suggestions on how to fix this. We do have some ideas: > > - Introduce a complexity factor in the judging. > > - Remove this strict judging process and just have "AdaCore" pick the projects that are the most impressive/cool. But that means it is very difficult for contestants to know what will be valued in their project. > > - Have more winners by spreading the prizes. e.g. 8 winners at 1000 euros instead of 5000, 2000 and 1000. > I suspect it will come down to a mix... Separate categories for beginner vs experienced, with points scored on both presentation and implementation/complexity. So, top prizes will probably be reduced to allow for multiple winners -- maybe drop third place and just have winner & runner-up, along with one grand winner. 1000 for each winner [beginner/presentation, beginner/implementation, experience...] (4000 total) 500 for each runner-up (2000 total) 2000 for grand winner (along with the 1000 for category win) -- Wulfraed Dennis Lee Bieber AF6VN wlfraed@ix.netcom.com HTTP://wlfraed.home.netcom.com/