Here are Traveller Mailing List Archive Message Numbers 238 and 250.

------- Forwarded Messages

Message-Id: <8903200616.AA08547@tektronix.TEK.COM>
Date: Sun, 19 Mar 89 23:29 EDT
From: RWMIRA01%ULKYVX.BITNET%CUNYVM.CUNY.EDU@cunyvm.cuny.edu
Subject: Re: Travel Times
To: traveller@dadla.LA.TEK.com
Reply-To: traveller-request@dadla.wr.tek.com
Resent-To: traveller-internal
Approved: by traveller@dadla Sun Mar 19 22:29:58 PST 1989
Archive-Message-Number: 238
Resent-Date: 19 Mar 89 22:30:11 PST (Sun)
Resent-From: Traveller Mailing List <jamesp>


>I have a MegaTraveller Question that frankly has be baffled.  I was computing
>orbital periods and distances between the Gas Giant and main worlds.  I was
>trying to compute the travel time between the gas giant and the main world.
[Stuff Deleted]
>Now figuring that the folks at GDW had ran into this questions the mention
>something about an "In System Transfer" in the Imperial Encyclopedia under
>travel, but they mention nothing more about times or methods other than to say
>that you use "In System Transfer" to get to a gas giant.  I remember a journal
>article on the subject where you "goosed" the jump drives, but it goes against
>all normal jump drive rules.  No to mention that the fuel consumption would
>make gas giant refueling impractical.
>
>Does any one have any light on
>  a) In system Transfer
[I still have questions on this one!!!]

>  b) Better time computations to and from Gas Giants.
>
Ok, I should have read the books a little better,  (Thankful I still have my
old Traveller stuff :-) .)  Here is a little 'C' program that I whipped up
that computes travel times.
   o /
- ----X-- Snip Snip Snip --------------------------------------------------------
   o \
/* TTIME.C
   Rob Miracle

   Language:  Ansi 'C'.
   Date:      March 18, 1989

   This program computes travel times for Traveller, a role playing game by
   Game Designer's Workshop.  It takes the distance to be traveled in
   Kilometers and returns a table of times.  The times are in days, hours,
   minutes, and seconds.  Each line represents the 6 different manuver drives
   in the game.  It is listed in G's of acceleration.  The formulas are based
   on ones found in "The Traveller Book".  They were originally published in
   Traveller Book 2, "Starships".

   This program compiles correctly under Turbo 'C' V2.0 and VAX/VMS 'C'.
   The only possible incompatiblity is with the 'pow' function.

   This program is placed in the public domain and I don't think that I
   am infringing on anyone's copyrights.  No warrentys or guareentees implied
   and the author assumes no liability.
*/

#include <stdio.h>
#include <math.h>

main() {
    int i,j;
    double TDist,TAccl;
    double Seconds,Minutes,Hours,Days;
    char buffer[128];

    printf("Distance (Kilometers): ");
    gets(buffer);
    TDist = atof(buffer) * 1000.0;
    printf("Days     Hours    Minutes  Seconds\n");
    for(TAccl = 10.0; TAccl < 70.0; TAccl += 10.0) {
        Seconds = 2.0 * pow(TDist/TAccl,0.5);
        Minutes = Seconds / 60.0;
        Hours = Minutes / 60.0;
        Days = Hours / 24.0;
        printf("%-8.1f %-8.1f %-8.1f %-8.1f\n",Days,Hours,Minutes,Seconds);
    }
}

    o  /
- -----X------ Snip Snip Snip -------------------------------------------------
    o  \

Any help would be appreciated!
Thanks in Advance, Rob
- --
Rob Miracle              | Bitnet   : RWMIRA01@ULKYVX    CIS: 74216,3134
Programmer/Analyst-II    | INTERNET : rwmira01%ulkyvx.bitnet@cunyvm.cuny.edu
University of Louisville | UUCP     : ...psuvax1!ulkyvx.bitnet!rwmira01


The Traveller Mailing List is a courtesy of James Perkins and Tektronix, Inc.
All opinions and material above is the responsibility of the originator.
Send Submissions To: @RELAY.CS.NET:traveller@dadla.wr.tek.com,
	major_node!tektronix!dadla!traveller, or traveller@dadla.wr.tek.com
List Administrator: traveller-request@dadla.wr.tek.com

------- Message 2

Message-Id: <8903220230.AA10851@tektronix.TEK.COM>
Date: Tue, 21 Mar 89 11:56 EDT
From: RWMIRA01%ULKYVX.BITNET%CUNYVM.CUNY.EDU@cunyvm.cuny.edu
Subject: MegaTraveller NPC Generator (C Source)
To: traveller@dadla.LA.TEK.com
Reply-To: traveller-request@dadla.wr.tek.com
Resent-To: traveller-internal
Approved: by traveller@dadla Tue Mar 21 18:55:29 PST 1989
Archive-Message-Number: 250
Resent-Date: 21 Mar 89 18:55:36 PST (Tue)
Resent-From: Traveller Mailing List <jamesp>


This little program creates pages of throw away NPCs.  Enjoy.

- ------8X-- Snip Snip Snip -----------------------------------------------------

/* NPC.C -- A MegaTraveller Non-Player-Character Generator
   Rob Miracle

   Language:  ANSI 'C'.
     This program has been successfully compiled under Turbo 'C' V2.0 and
     VAX/VMS 'C'.

   Purpose
     This program was written to generate pages of NPCs for MegaTraveller.
     These NPC's are for Non-important characters who will most likely
     be envolved in combat with the players and whose life span is so
     short that they do not need more detail.  The output is simple.
     Each NPC has their 6 digit statistics which are hex digits ranging
     from 0 to 15 (for simplicity, these range from 2 to 12).  The stats
     are coded in the following order:
       STRENGTH DEXTERITY ENDURANCE INTELLEGENCE EDUCATION SOCIAL_STANDING

     After the stats are their pluses to hit for Strength in hand-to-hand
     situations, their pluses to hit for Dexterity for range combat.  Their
     pluses to hit for a particular hand to hand weapon and their pluses to hit
     with a range weapon.  Add the two together and get their total combat
     pluses for each type of combat.

     Now for the quasi-legal stuff.  Due to the simple nature of the
     process, I am not going to bother with the paper work and let the
     Common Copyright Law take care of me!  It is being placed in the
     public domain.  (Let's face it, would you pay for something this
     simple?)  This software comes without warrenty and the author is not
     liable for any damages that it may cause.  Any similarity to any other
     work is purely conencidental.  I mean, how many ways are there to do
     this?


     To Compile Under:
       MS-DOS with Turbo C V2.0
         tcc -mt -lt npc
       VAX/VMS
         cc npc
         link npc
       Unix System V and BSD
         cc -o npc npc.c

     To Execute Under:
       MS-DOS and Unix:
         npc n     where n is the number of npc's to generate.
       VAX/VMS
         npc :==$'f$environment("default")'npc
         npc n

*/

#include <stdio.h>

/* Big COMPLEX Dice Rolling function: s is the number of sides on a dice */
/* to roll */
int d(int s) {
  return(rand() % s + 1);
}

/* Majorly Intricate function to generate headers at the top of a new page */
void newpage() {
  printf("%c NPC UPP     +Str  +Dex  Melee  Firearm\n",12);
}

main(argc,argv)
  int argc;
  char *argv[];
{
  int i,j,k,l,upp[10]; /* Counters, temp variables, and the stat registers */
  int lineno = 70;

  /* Very Difficult Command line Parsing procedure */
  if(argc != 2) j = 30;
  else j = atoi(argv[1]);
  if (j == 0) j = 30;

  /* Seed the random number generator with something semi-unique */
  srand(time(NULL));

  /* Loop for j NPCs */
  for(i=1;i<=j;i++)
   {
    if (lineno > 59) {   /* If we are past the page, then start a new one */
      lineno = 0;
      newpage();
    }
    /* Generate the six stats.  This is the hardest part of the program */
    for(k=0;k<6;k++) upp[k] = d(6)+d(6);
     upp[6] = upp[0] / 5;   /* Computer +'s to hit for str */
     upp[7] = upp[1] / 5;   /* and Dex */
     l = d(6);              /* Compute the hand-to-hand skills */
     switch(l) {            /* On a 1, 2, or 3, their skill level is 1 */
       case 1 :             /* On a 4 or 5 it is a 2, and on a 6 it is a 3 */
       case 2 :
       case 3 : upp[8] = 1; break;
       case 4 :
       case 5 : upp[8] = 2; break;
       case 6 : upp[8] = 3; break;
     }
     l = d(6);              /* Repeat the process for Fire Arms */
     switch(l) {
       case 1 :
       case 2 :
       case 3 : upp[9] = 1; break;
       case 4 :
       case 5 : upp[9] = 2; break;
       case 6 : upp[9] = 3; break;
     }
     /* Print the results */
     printf("%3d %1X%1X%1X%1X%1X%1X   %3d   %3d    %3d    %3d\n\n",
        i,upp[0],upp[1],upp[2],upp[3],upp[4],upp[5],upp[6],upp[7],
        upp[8],upp[9]);
     lineno += 2;           /* Increment the line number */
   }
}

- ------8X-- Snip Snip Snip -----------------------------------------------------
Rob Miracle              | Bitnet   : RWMIRA01@ULKYVX    CIS: 74216,3134
Programmer/Analyst-II    | INTERNET : rwmira01%ulkyvx.bitnet@cunyvm.cuny.edu
University of Louisville | UUCP     : ...psuvax1!ulkyvx.bitnet!rwmira01

The Traveller Mailing List is a courtesy of James Perkins and Tektronix, Inc.
All opinions and material above is the responsibility of the originator.
Send Submissions To: @RELAY.CS.NET:traveller@dadla.wr.tek.com,
	major_node!tektronix!dadla!traveller, or traveller@dadla.wr.tek.com
List Administrator: traveller-request@dadla.wr.tek.com

------- End of Forwarded Messages