Lots of people on this forum are far better at chess than me, but there is a key thing to consider here.
PAO works at its best when the information to memorise is uniformly distributed. i.e. 100 rolls of a single dice.¹ When the same Ps,As, or Os turn up a lot, you get very likely to make mistakes (‘Einstein is moonwalking with a banana, now Einstein is moonwalking with a Lego, now Trump is moonwalking with a banana’)
Chess move destinations are anything but randomly distributed:
Trying to use PAO on a decent amount of this sort of data feels like your world is going to get very small, very fast, and that’s going to hurt.
@JohnDen’s approach with number of syllables length is a nice alternative because it both ‘hashes’ the value to be reasonably evenly distributed⁰, and more importantly, allows a lot of creativity to be used for the key.
In general, I’d go as far as to say that PAO is a poor choice for any structured data (British phone numbers or numberplates are good examples), but particularly so far anything quite as narrative as chess moves…
(I actually really like this chess example as a good one for pointing out problems with approaches like PAO and I think I might try and write that up properly)
⁰ I actually have to check this with a script and a database of games, I might be wrong
¹ Although rolling two dice and recording the total 100 times definately isn’t…

