- Oct 5, 2017
- 7,386
- 9,770
Not really, it would be pretty simple to make an implementation withProbably not viable due to the sheer number of girls in the hotel. I think there would need to be (number_of_girls - 1)^2 scenes made for that (someone want to check my math?), and with eight girls currently in the hotel that would be 49 combinations before Runey inevitably adds more girls.
2n-1
scenes. Given how short the bedtime/morning scenes are, the whole thing would probably be roughly equivalent to one story event? Special cases like the twins would add a little to that of course, but the general form is definitely linear not quadratic.(Also if you want all possible permutations it's
n(n-1)
, not (n-1)^2
)