# Alphabetic string theory

According to alphabetic string theory, the words we see are merely the visible portions of highly convoluted loops of multi-dimensional alphabetic string.

For example, here is what we see in our space-time:

But if we were able to perceive the entire loop of multi-dimensional alphabetic string, it would look something like this:

In case you're having trouble seeing the alphabetic loop, here it is annotated:

Are you ready for your PhD in alphabetic string theory? See if you can show the entire alphabetic loop for this word:

• Do we need to stay within the black rectangle? Or even stay within a one-tile border like the example?
– xnor
Dec 26, 2023 at 21:41
• @xnor — You may assume that the black region is unbounded and extends infinitely. Dec 26, 2023 at 22:35
• @Simd — At the very least, the word cannot use any letter more than once, and the letters must be appropriately spaced within the word. For example, the word REALIST won't work because the R and the S are too far apart. Beyond those two conditions, I'm not sure yet. I am currently running my solver on all the words which meet the two conditions to see if any of them don't generate a solution. Then we can explore why. Dec 27, 2023 at 14:20
• There are more conditions to make this solvable, for example the 'word' AFKDIN doesn't allow an alphabetic string because while you could connect the A-D, F-I and K-N individually, you can't put all three paths without intersections. Unfortunately AFKDIN is not in any dictionary but there may be proper dictionary words that have this problem as well. Dec 27, 2023 at 16:25
• @happystar — I'm starting to see some words with problems: BAKESHOP, LAYOVERS, OUTREACH. Alphabetic String Theory might be on shaky ground here..... Dec 27, 2023 at 22:58