Rogue Ship

Rogue Ship is a 1965 science fiction novel by Canadian-American writer A. E. van Vogt, adapted from three short stories to form a novel. The three short stories used were:

Rogue Ship
First edition
AuthorA. E. van Vogt
Cover artistPeeter Rauch
CountryUnited States
LanguageEnglish
SeriesCentaurus
GenreScience fiction
PublisherDoubleday
Publication date
October 1965
Media typePrint (Hardcover)
Pages213
OCLC23043729

Using Van Vogt's own terminology when creating a novel from 3 previous short stories, he named it a fixup.

Plot summary

Centaurus is the destination of the space ship The Hope of Man. It has been traveling through space for almost twenty years, and still has nine years of flight remaining. For many on board the craft, Earth has become a vague memory, while for others it is a mere dot in the vast starry reaches of space. Restlessness is evident everywhere; the people want to return to a place they know is inhabited - not continue to an unknown where life is uncertain. Mutiny seems inevitable. Captain Lesbee (the ship's main officer) knows that mutiny breeds mutiny, but what is more significant is his knowledge of Earth's possible obliteration. The one hope is Centaurus. Now more than ever, there can be no turning back. Order has to be maintained even at the price of human life.

After reaching Centaurus and finding it unsuitable for human life, The Hope of Man heads towards the next destination, the Alta system. Because the ship is unable to attain light speed it takes decades to travel there. Upon arriving in the system, after mutiny and treachery, The Hope of Man is now captained by Browne, a descendant of the ship's original First Officer. The Hope of Man enters into orbit around Alta III, but find it already inhabited and come under attack from the occupants. During this time we see a struggle for power by various groups. Control changes quickly from one character to another until the arrival of the ship's owner, Averill Hewitt. The novel concludes with Hewitt in charge and the ship finding many planets to inhabit.

gollark: Here is a copy of the code I don't understand from the old version:```lualocal function descend(intermediateFn, terminalFn, i) local pattern = patterns[i] if pattern then intermediateFn(pattern) local pqty = pattern.qty -- Qty keys must be removed from the pattern for collation -- Otherwise, it shows up as a number stuck in the items needed table, which is bad. pattern.qty = nil local needs = util.collate(pattern) pattern.qty = pqty local has = {} for slot, item in pairs(pattern) do if util.satisfied(needs, has) then break end if patterns[item] then descend(intermediateFn, terminalFn, item) has[item] = (has[item] or 0) + (patterns[item].count or 1) end end else terminalFn(i) endendlocal function cost(i) local items = {} descend(function() end, function(i) table.insert(items, i) end, i) return util.collate(items)endlocal function tasks(i) local t = {} descend(function(pat) table.insert(t, pat) end, function() end, i) return tend```
gollark: Also, implementing whatever is done internally for finding free space to transfer to is hard!
gollark: I'm unlikely to have stupidly large autocrafting trees.
gollark: As long as it doesn't take more than a second it fits within my performance goals.
gollark: RandomTwentyLineAlgorithmIWrote.



This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.