“…= 403,291,461,126,605,635,584,000,000, or 4.03 E+26) possible ways to arrange a sequence of 26 letters, an NP-complete problem that is currently computationally intractable to optimize. Attempts to solve the "keyboard arrangement problem" have been ongoing (Ladany, 1975), with more recent contenders applying simulated annealing (Light and Anderson, 1993;Krzywinski, 2015;Salvo et al 2016), ant colony optimization (Eggers et al, 2003;Wagner et al, 2003), Cyber Swarm (Yin and Su, 2011), and genetic algorithms (Deshwal and Deb, 2003;Walker, 2003;Goettl et al, 2005, Deshwal andDeb, 2006;Malas et al, 2008;Khorshid et al 2010;Onsorodi and Korhan, 2020;Pacheco et al 2020).…”