 |
Cyber Warrior
|
|
Join Date: Oct 2002
Location: Newcastle upon Tyne
Posts: 10,279
|
|
|
Cyber Warrior
Join Date: Oct 2002
Location: Newcastle upon Tyne
Posts: 10,279
|
I once wrote a program in GW Basic that would:
1) take the names of the mother (maiden name) and the father.
2) Work out how many characters was the longest and the shortest name
3) produce a list of "words" that varied at random between the shortest and the longest of the names of the parents.
4) each word would consist of letters randomly picked from the combined names of the parents.
5) You then go through the list and select any "word" which is pronouncible, not rude and seems ok
6) You use that for the child's name.
Clear ?
Since a child is a random mix of the parents DNA, I thought that the name of the child should come from a random juggle of the characters in the parents names
I could dig it out if anyone wants, but they would also need to have GW Basic, which is quite old now.
|