A83: Contest II (MUL/DIV)...

[Prev][Next][Index][Thread]

A83: Contest II (MUL/DIV)...


For all of you Z80 programmers who thought the previous contest was too
easy (and didn't submit any entries :) this new contest is for you!  This
time, you will be writing code for MULtiplication and DIVision commands.
Since other contests have rules, this one has to have rules as well.  So,
here are the rules for this contest:

1)  NO self-edit routines will be accepted.
2)  The following commands have to be written in order to win:
  MUL A,A  MUL B,A  MUL C,A  MUL D,A  MUL E,A  MUL H,A  MUL L,A
  MUL A,B  MUL B,B  MUL C,B  MUL D,B  MUL E,B  MUL H,B  MUL L,B
  MUL A,C  MUL B,C  MUL C,C  MUL D,C  MUL E,C  MUL H,C  MUL L,C
  MUL A,D  MUL B,D  MUL C,D  MUL D,D  MUL E,D  MUL H,D  MUL L,D
  MUL A,E  MUL B,E  MUL C,E  MUL D,E  MUL E,E  MUL H,E  MUL L,E
  MUL A,H  MUL B,H  MUL C,H  MUL D,H  MUL E,H  MUL H,H  MUL L,H
  MUL A,L  MUL B,L  MUL C,L  MUL D,L  MUL E,L  MUL H,L  MUL L,L
  MUL A,@  MUL B,@  MUL C,@  MUL D,@  MUL E,@  MUL H,@  MUL L,@
  MUL A,(HL)
  MUL B,(HL)
  MUL C,(HL)
  MUL D,(HL)
  MUL E,(HL)
  MUL H,(HL)
  MUL L,(HL)
  MUL HL,BC
  MUL HL,DE
  MUL HL,HL
  MUL HL,@@
  MUL HL,(@@)

  DIV A,A  DIV B,A  DIV C,A  DIV D,A  DIV E,A  DIV H,A  DIV L,A
  DIV A,B  DIV B,B  DIV C,B  DIV D,B  DIV E,B  DIV H,B  DIV L,B
  DIV A,C  DIV B,C  DIV C,C  DIV D,C  DIV E,C  DIV H,C  DIV L,C
  DIV A,D  DIV B,D  DIV C,D  DIV D,D  DIV E,D  DIV H,D  DIV L,D
  DIV A,E  DIV B,E  DIV C,E  DIV D,E  DIV E,E  DIV H,E  DIV L,E
  DIV A,H  DIV B,H  DIV C,H  DIV D,H  DIV E,H  DIV H,H  DIV L,H
  DIV A,L  DIV B,L  DIV C,L  DIV D,L  DIV E,L  DIV H,L  DIV L,L
  DIV A,@  DIV B,@  DIV C,@  DIV D,@  DIV E,@  DIV H,@  DIV L,@
  DIV A,(HL)
  DIV B,(HL)
  DIV C,(HL)
  DIV D,(HL)
  DIV E,(HL)
  DIV H,(HL)
  DIV L,(HL)
  DIV HL,BC
  DIV HL,DE
  DIV HL,HL
  DIV HL,@@
  DIV HL,(@@)
3)  You may use line labels and short jumps (JR) in your commands.
4)  ONLY the flags may be destroyed and the register(s) that the result is
being stored into.
5)  NO OPCODES will be accepted.  All commands must be entered using
Mnemonics (e.g. LD A,B).
6)  All entries must be sent to <shinelight@crosswinds.net>.  NO ENTRIES TO
THE LISTS WILL BE ACCEPTED!

As with the previous PUSH/POP contest and all other contests, this contest
has a prize.  You will get your name in the credits of TAZM.  Okay, that
isn't exciting enough?  You will get to be an automatic beta tester for
TAZM.  Still not enough?  Okay, you will become an automatic beta tester
for SQRXZ 82!!!  Don't own an 82?  Your name will still appear in the credits!

Since this is a really long list of commands to create, the deadline for
ALL entries will be 7/30/1999.  You may submit more than one entry, but the
previous entry sent in will be deleted.

Since there are so many commands, please try to make your entries as
readable as possible.

The winner will be determined by the person who has the fewest total bytes
and clock cycles overall.  Clock cycles, bytes, and entry date will break
ties (in that order).  The top three winners will be announced and the
first place winner will have their entry displayed as well.

Good luck and have fun programming!

BTW, I don't just make these contests just to get source code (although,
faster source is an objective, it isn't the only one).  I participate as
well to see how I match up against the best of the best :)  Again, enjoy!


           Thomas J. Hruska -- shinelight@crosswinds.net
Shining Light Productions -- "Meeting the needs of fellow programmers"
                  http://www.shininglightpro.com/
Follow-Ups: