NOTE: Due my busy schedule, this first version of this post is very bad english. I reserve rights to edit this in near future, but rules are what they are. I only touch make sentences look nicer and clearer.
Greetings folks. This is a launch for basicprogramming.org Winter 2009 Competition.
The mission:Generally speaking the mission is simple. There is a list of 200 words, from what is randomed 20 words. Goal of your program is to figure out, what word is currently randomed.
For example, next 20 words are randomed from the list;
spaceship, green, freebasic, star trek, white, jupiter, windows, fox, one, rollerblades, diary, king, three, drums, eight, soccer, general motors, sunshine, hammer. Naturally list of randomed words is 100% same for each program.
Now, your program needs to solve out those words in order they are randomed. At this point, first word is
"spaceship". How to do it? About that in next...
Your program:As told, first word is in this example is a
"spaceship". Your program can figure it out by asking a questions. You can make your program ask what ever you want, but there will be only three possible answers.
y stands for "Yes". If your program ask's "Does it have a engine?", reply would be "y".
n stands for "No". So if your program ask's "Is it a color?", reply would be "n".
c is the third possible reply. In this case, if your program would ask "Is it in Canada?", reply would be "c", since there is not valid location for spaceship as general word. Spaceship can be in lot's of places, including space. Though, it can be docked at Houston too

If your program tries to guess the word instead of asking more information, output will be "Word is (word)?". Reply will be either "y" or "n". Example of one word later in this post.
It is highly important to plan your questions. If question is not clear enough, reply will be "c" easily.
Your program has 100 turns to figure out all 20 words. Same word can be only at once.
Features of your program:Beside of allready mentioned question and reply features, your program can do bit more too. If it seems that your program cant solve current word, it can skip it and move to the next one. At this point, your program must clearly output that it wants to move on next word.
There is not specified way how to output this, it's up to you. It is highly recommended that you make this feature dumb-proof.
Input & Output:Your program must ask questions and guess the word in english words. You can use console or windowed mode for this. There is not any certain way you are expected to do this.
Your program gets replies from a keyboard, and keyboard only. All replies (
"y, n, c") are returned in lowcase.
Points, points and more points;Each program starts from 0 points. Each question from your program "cost's" 1 point. Each wrongly guessed word cost's 3 points. If your program skips a word, it looses 10 points.
Each word your program does guess, gives 25 points.
If your program guesses correctly all 20 words in less than 100 turns, it gets 5*(100-used turns) points.
Program which is voted as "Best logger", gets extra 10 points. "Best logger" is solved out by poll, from what each competitor and forum member can give one vote. In tie situation, no "Best logger" points shared.
If two or more programs ends in same number of points, here is how we solve the winner.
1. Which program solved more words totally.
2. Which program solved words in smaller amount of turns.
3. Which program solved first word in smaller turn number.
4. Reround between these programs with new words, following rules 1 to 3.
5. Tie. Winners negotiates for who or where prize is pointed. If they cant do it in max. 7 days, prize is donated to WWF.
Allowed dialects:This time, there is limited number of basic dialects with what you can join for this competition. Number of different dialects is so huge, that it can cause some major problems for judge (thats me).
Allowed dialects for basicprogramming.org winter 2010 competition.
Bywater BASIC;
http://bwbasic.sourceforge.net/Vintage Basic;
http://www.vintage-basic.net/FreeBasic;
http://www.freebasic.netthinBasic;
http://thinbasic.com/ NOTE:Wine combatibility of your program is demanded.
yabasic;
http://yabasic.basicprogramming.org/ChipMunk Basic;
http://www.nicholson.com/rhn/basic/RunBasic;
http://runbasic.com/QB64;
http://www.qb64.net/sdlBasic;
http://www.sdlbasic.altervista.org/main/index.phpBaCon;
http://www.basic-converter.org/GW-BASIC;
http://en.wikipedia.org/wiki/GW-BASICQBasic;
http://en.wikipedia.org/wiki/QbasicSmallBasic;
http://smallbasic.sourceforge.net/Blassic;
http://blassic.org/XBLITE;
http://www.xblite.com/ NOTE:Wine combatibility of your program is demanded.
ScriptBasic;
http://www.scriptbasic.org/home/The log:Your program must create a text log of each question, guess, skip notice and replies it has received from keyboard. Give value for this option, since it can deliver extra 10 points for your program.
The prize:Winner of this competition get's 50.05$(us), and runner-up (2'nd) get's 12.34$(us). Prizes are payd through
PayPal, and PayPal only. Incase you (or any of your friend) dont have PayPal account, you can point some organisation for what the prize is donated in your name. Political and religional organisations are not accepted. If you cant point a place where to pay the prize, moneys goes to WWF. You have 7 days time to inform me, where to send the moneys.
Competition time:Competition starts now, and programs must be delivered to me before 20'th January 2010. Judge (still me) reserves 3 days (to 23'th Jan. 2010) time to run all programs that takes part for this contest. All programs must be send at
contact@basicprogramming.org with a subject "BP.ORG Winter combo" before 20'th Jan. 2010.
Number of programs per competitor:You can send max. 2 programs, and you cant send edited codes afterwards. Once you send your code, it is late to fix or edit it anymore. So give yourself a time to test your code. There is time
Team work:Programs must be send by a person, not by a team. Sure you can team up and create a code, but it must be send as a private person.
Who can join?:Person who wants to take a part for this competition, must be registered in these forums. Post count can be 0, and you can remove your account right after competition is over, but till that moment, you need to be registered at this forum. This is because its easier to arrange poll for the "Best logger".
Other:Program must be send as source file. There must be clearly stated at the begin of code, who made it, name for the program and license. GPL2, public domain or similar is recommended, since if its not possible to reveal your code in public, it is not accepted for this competition.
Log file of your program must be created so, that it is possible to open with a www-browsers. It is recommended to use pure text file, html, xhtml or related.
Program must be packed in .zip form.
There must be readme.txt or similar document in your .zip archive, where is all information needed to run your code. All needed files (except basic interpreter/compiler itself) must be in .zip archive, and paths/folders must be in order so that i need only to lauch the file, what is mentioned at readme.txt.
Program must run in basic (default) installation of used dialect. If your code demands some third party libraries that needs to install, your program is not accepted for this competition.
You can use file of listed words just as you want. Edit it, rearrange words, heck take some of them out if you want. Your program needs to solve from those words which one is currently waiting to be revealed, its up to you how you do it

I saved them as DATA lines, but you can make them as text file...what ever, as long as i dont need to do anything extra because of them

If you use words from external file, add that file in .zip archive.
Example run:Word 1.
Question: Does it have a heart?
n
Question: Is it on earth?
c
Question: Is it colorfull?
c
Question: Does it have a engine?
y
Question: Does it move on ground?
y [i]Well yes, when its on firing up or landing[/i]
Question: Does it have a four wheels?
n
Guess: Is it a motorcyle?
n
Question: Can it fly?
y
Question: Does it have a wings?
y
Question: Can it fly on space?
y
Guess: Is it a spaceship?
y
Word guessed, moving to word 2.
...
...
...