Originally Posted by
Maul
Not really. By itself, it would be a trivial programming challenge. Even in C, I believe a simple linked list would work well.
TB has specifically stated it would require too much work to implement - nothing in ADOM is a "trivial" task.
gate closers: GeWi GnMo(unarmed) DeAs/Pa/Mi(staves)/Ra GePr DrBb HrMo | p7: MeBf | p17: GnPr | p20: DrDu GnAs DeCk MeWp OrBf GnTh MeHe | R57: MeDu | R101: DrAs (26,674 turns) GnDu (26,748) DrAs (18,533)
ULE: HeRa — OCG: DeMi
currently speedrunning DrAs.