The V.A.S.T. Programmers Challenge(VPC) FAQ (v0.13)
	--------------------------------------------------


(1)How do I contact the V.A.S.T. Programmers Challenge?

vpc@ccs.neu.edu		for VPC entries.
vast@ccs.neu.edu	for VPC comments, topic suggestions, votes, etc.
jeffc@ccs.neu.edu	VPC maintainer, VPC-FAQ maintainer.


(2)How do I access the VPC archives?

via ftp:	ftp.ccs.neu.edu/pub/VASTPC/
via www:	http://www.ccs.neu.edu/home/jeffc/VASTPC/


(3)How do I upload entries?

via ftp:	ftp.ccs.neu.edu/pub/VASTPC/incoming/
via email:	send uuencoded files to vpc@ccs.neu.edu

Please, make sure KRZ files are uploaded as BINARY, and TXT files are uploaded
as ASCII.


(4)What are the rules?

Each month a VPC Directive will be issued, it will contain the rules for that
months challenge.  Some of the global rules are:
	(a)submitting copyrighted material is forbidden.
	(b)submitting others work as your own is forbidden.
	(c)each entry must have an accompanying text file which includes:
		(1)authors name, and email address
		(2)description of the file
		(3)list of supported control sources


(5)What objects can I include in my submission?

Please reference the current VPC Directive.


(6)How late can I submit my entry?

Each VPC runs from the 1st of the month to the last day of that month.  Entries
will be accepted from 12:00:00AM(EST) on the 1st to 11:59:59PM(EST) on the
last day of the month.


(7)What do I win?

Respect from your peers!  A better knowledge of V.A.S.T. programming!  Maybe
something more...  Chuck Surack of Sweetwater Sound has graciously donated one
K2.xk CD-ROM from the Sweetwater CD-ROM Library as the prize for first place
(retail US$329.00), and Larry Ketchell of Young Chang America is sending some
miscellaneous Kurzweil stuff for second and third place.


(8)Who are the judges?

You are!  Everyone on the K2000 mailing list is eligable to download the
entries and pick their favorite with respect to the VPC Directive.  Anyone
who enters is also allowed to vote on their favorite.  If multiple votes are
received from the same person, only the last vote will be counted.


(9)When will the 'favorite' be announced?

At 12:00PM(EST) on the 15th of each month, the votes for the previous months
VPC will be totalled and email will be sent to the K2000 List, and posted on
the VPC WWW Page.


(10)How/When are the VPC Directives released?

At approximately 12:00:00AM(EST) on the 1st of each month, the VPC Directive
for that month will be mailed to the K2000 List, and posted on the VPC WWW
Page.

(11)Why are the entries voted on?

All entries are voted on to create an atmosphere of positive competition.  It
is my assumption that people will download them(to vote on them) and if they
hear something unique/interesting they will look into the program to see how
it was constructed - thereby furthering their knowledge of V.A.S.T. programming
without actually participating in the challenge itself.

(12)What is the criteria for the voting?

Anyone wishing to vote should listen to ALL the entries and determine which one
they like the best.  The winner is the one who produces the most liked entry,
not necessarily the most technologically superior entry.  All voters should
take into account how closely the programs mirror the VPC Directive, however.

(13)How does this all work?

Here's a sample timeline:
	1st of the month - new VPC Directive is posted
			   voting begins on last months VPC
			   entries excepted for the current VPC
	15th of the month - last day to vote on last months VPC
			    the favorite from last VPC is posted at noon (EST)
	last day of the month - last day to submit entries for current VPC


(14)Hey what about XYZ?

I'm sure I've forgotten some of the details that you'll need to know... please
forward all questions/comments to: vast@ccs.neu.edu

-------------------------------------------------------------------------------
      V.A.S.T. is a registered Trademark of Young Chang America/Kurzweil
-------------------------------------------------------------------------------
Draft 3 of VPC-FAQ 03/05/96-22:53:47 EST (jeffc@ccs.neu.edu)