Mr. X (Straub novel)
 First edition | |
| Author | Peter Straub |
|---|---|
| Language | English |
| Genre | Horror, mystery |
| Published | 20 July 1999 |
| Publisher | Random House |
| Publication place | United States |
| Pages | 482 (first edition) |
| Awards | 1999 Bram Stoker Award[1] |
| ISBN | 0-679-40138-5 |
| OCLC | 40150621 |
Mr. X is a 1999 horror mystery novel by American writer Peter Straub. The book won the 1999 Bram Stoker Award for Best Novel[1] and was a 2001 August Derleth Award nominee.[2]
The novel is a tribute to H. P. Lovecraft.[3][4]
Synopsis
[edit]The novel tells story about Ned Dunstan, a computer programmer with an odd past that he finds himself constantly questioning. Every year on his birthday, Ned is cursed with visions of horror committed by a savage figure he calls "Mr. X." Now, as his 35th birthday approaches, Ned has been drawn back to his home town of Edgerton, Illinois, by a premonition that his mother is dying. His mother reveals the identity of his mysterious father and warns him of grave danger. Ignoring the warnings, Ned explores his dark past and the astonishing legacy of his kin, driving the case to a sinister turn as it appears he may or may not have a devious doppelgänger responsible for gruesome murders. Soon, Ned is accused of crimes he couldn't possibly have committed, while he enters a hidden world of ominous mysteries, where he must confront his deepest nightmares.
See also
[edit]References
[edit]- ^ a b "1999 Award Winners & Nominees". Worlds Without End. Archived from the original on August 4, 2009. Retrieved 2011-11-05.
- ^ "2001 Award Winners & Nominees". Worlds Without End. Archived from the original on July 22, 2012. Retrieved 2011-11-05.
- ^ "Mr. X by Peter Straub". www.publishersweekly.com. 1999-06-28. Retrieved 2022-09-07.
- ^ "Onyx reviews – Mr. X by Peter Straub". www.bevvincent.com. Retrieved 2022-09-07.
 | This article about a 1990s novel is a stub. You can help Wikipedia by expanding it. See guidelines for writing about novels. Further suggestions might be found on the article's talk page. |