Havoc #5

Danganronpa takes place at an elite high school named Hope's Peak Academy, which accepts talented "Ultimate" students of the highest caliber in various fields each year. Makoto Naegi, a fairly optimistic but otherwise average student, is selected in a raffle and chosen to enroll into the academy as the "Ultimate Lucky Student". However, when Makoto arrives at the Academy, he loses consciousness and wakes up locked inside the school, where he meets fourteen other newly picked Ultimate students who are in the same situation as him. A sadistic, remote-controlled bear named Monokuma appears before them, telling them they will be imprisoned in the academy for the rest of their lives, and that they will be put to death if they violate any of the school's rules. He states that there is only one way that a student can leave the academy: murder another student and avoid being identified as the culprit.


Aliases
  • Danganronpa: Trigger Happy Havoc
English 日本語
  • TheTVDB.com Movie ID 289070
  • Status Released
  • Released Japan November 25, 2010 United States of America February 11, 2014 China February 14, 2014 Great Britain February 18, 2016 Australia November 23, 2010
  • Content Rating New Zealand M Brazil 12 Brazil 16 Australia M
  • Runtime 61 minutes
  • Genres Adventure Mystery
  • Original Country Japan
  • Original Language English
  • On Other Sites IMDB Official Website TheMovieDB.com
  • Favorited This movie has been favorited by 0 people.
  • Created October 18, 2021 by
    Administrator admin
  • Modified October 18, 2021 by
    Administrator admin

No artwork of this type.

No artwork of this type.

No artwork of this type.

No artwork of this type.

No artwork of this type.

No artwork of this type.

No lists.

Danganronpa Franchise

1 6 NMe84

Danganronpa is a Japanese video game and visual media franchise created by Kazutaka Kodaka. The series primarily surrounds various groups of apparent high school students who are forced into murdering each other by a robotic teddy bear named Monokuma.

No lists.

Please log in to view notes.