z390-assembler-contest at Yahoo! Groups

ZMFACC Mainframe Assembler Coding Contest - new solution for #11 has

Don Higgins — Sun, 21 Sep 2008 23:35:47 GMT

All David Wilkinson has submitted a new solution for #11 with fewer instructions. See the contest webpage for details:

New solution to Mainframe Assembler Coding Contest Problem #5 using

Don Higgins — Mon, 08 Sep 2008 20:24:45 GMT

All I am pleased to announce new #1 solution for problem #5 submitted by David Wilkinson. Here is a way to translate any number of binary bytes to EBCDIC hex

New faster solution to ZMFACC Mainframe Assembler Coding Contest Pro

Don Higgins — Mon, 11 Aug 2008 13:37:56 GMT

All The following 3 new solutions and 1 new problem have been contributed: * 08/11/08 * P17DW1.MLC /LOG

z390 ZMFACC Assembler Coding Contest Update 06/09/08

Don Higgins — Mon, 09 Jun 2008 23:52:49 GMT

All * P7EH1.MLC/LOG by John Erhman - has been updated to remove work-around for AW since the latest z390 PTF v1.4.01f now has support for AW and all the HFP

Here is a quick and hopefully easy assembler quiz question which cam

Don Higgins — Sun, 08 Jun 2008 03:02:18 GMT

All It's been a while, but the contest will resume once z390 priority 1 compatibility RPI's are fixed hopefully in the next day or two with RPI v1.4.01f. I'm

ZMFACC Mainframe Assembler Coding Contest - Solution to #20 random n

Don Higgins — Fri, 11 Apr 2008 21:15:05 GMT

All Congratulations to Werner Rams for coding and testing published random number generator which ran for 5 hours on his PC without any duplications. To see

Re: ZMFACC Mainframe Assembler Coding Contest Update 03/28/08 #19 So

Martin Ward — Wed, 09 Apr 2008 13:34:02 GMT

... Non-repetition is not a very good test for a random number generator. Eg start with a 64 bit seed and increment by one on each call. Your test program will

ZMFACC Mainframe Assembler Coding Contest Update 03/28/08 #19 Soluti

Don Higgins — Wed, 09 Apr 2008 13:04:09 GMT

All Congratulations to Werner Rams for solution to #19 using TRTR. Honorable mention also goes to Steve R.K. for sending email suggesting TRTR earlier the

ZMFACC Mainframe Assembler Coding Contest Update 03/2108 Solution to

Don Higgins — Fri, 21 Mar 2008 22:01:59 GMT

All Following the release of z390 v1.4.01a with new date and time callable routine named DAT that can be used for benchmark testing, I've published a first

Correction on the number of instructions required for solution to pr

Don Higgins — Sun, 09 Mar 2008 13:02:59 GMT

All Correction on the number of instructions required for solution to problem 17 - it is 827 and not 30,619. I had mistakenly published the instructions per

ZMFACC Assembler Coding Contest Update 03/07/08 - Solution to #17 an

Don Higgins — Fri, 07 Mar 2008 16:19:48 GMT

All Congratulations to Werner Rams for the first solution to problem #17. His solution compresses and decompresses 3 records using CLCL to detect end of

ZMFACC Coding Contest Update - 02/23/08 - New #1 solution to problem

Don Higgins — Sat, 23 Feb 2008 23:08:02 GMT

Congratulations to Werner Rams for a better solution to primes from 3 to 97 using bit table!

Re: Problem 17

Don Higgins — Sat, 23 Feb 2008 12:46:28 GMT

John, all My intention in using the work "transparent" was to indicate that all 256 EBCDIC characters are allowed including any kind of operand characters and

Re: ZMFACC z390 Mainframe Assembler Coding Contest Update 02/22/08 -

Don Higgins — Sat, 23 Feb 2008 12:46:18 GMT

Martin Thanks, after SHARE I'll take a run at optimizing the SQXTR routine. The emulator pz390.java code for the SQXBR and SQXR routines actually uses Math

Problem 17

John P. Baker — Sat, 23 Feb 2008 11:49:44 GMT

Can we have some clarification on Problem 17 in as far as any constraints on the operand field. For example, compressing: L1 CLI F1,64 Is much easier