derivative of binarycoder dc new: playerless could actually be harder than winless due to the thing that winless can be measured by gameplay and since the player doesn't exist it is actually impossible to judge a gameplay difficulty by its looks. playerless towers are pretty much towers that delete the player out of existence or the player cant interact with the tower at all and also cant win. you can mix winless with playerless to make the room of true nothingness. winless can be either when the win cant be reached within a integer, for when it is not a integer number or for when the win doesn't exist at all (well not really) bugged is for when mechanisms for Vt or Th doesn't work bulking of height is pretty much named like that because the towers can either be really tall and long or the wait is long, it can both be used for vanilla and theoretically possible towers vanilla possible is in-between physically impossible and nil since there are infinitely many ways to possible in binary's dc literal is barely AJ-possible, I stole it from ejt nil and below is pretty much like binary coder's dc
@BinaryCoder12 for comparison, JFoAEPUTLMAWBTtMAUIMYCJMA1KYLMSUIoARTYCABSHARtMT is ~mid-high BoH
