Adding on: with bacon the first thing to always do is to separate the groups of 5 by drawing a line between them or something. After that look for a group of 5 that are similar that fit in A or EI would attempt to see how grouping would create a logical response. On a test I took they used a Baconian with odd and even numbers as A and B. I suspect that in this case, A is most likely <, [, { and B is most likely >, ], }. If I could see how the test was formatted I could test this theory out but in a nutshell, you need to find patterns in Baconian ciphers. Also, don't forget to bunch everything into fives.At a recent competition, there was a Baconian alphabet problem. Instead of A's and B's, they used the symbols <, >, [, ], {, }, (, and ). No hint was provided, and there were 52 letters in total. There were no repeating sets of symbols. How would someone tackle this problem?

So like )>}]} are all similar and fit in the AAAAA for the letter A and those 5 would likely be A

Or (<}([ fit in the AABAA for E

I guess they could be annoying and set them randomly to A and B where there is no pattern. In this case you could count the frequency of each symbol for part of the cipher. Assuming they distribute each A and B equally among the symbols, A appears more frequently then B and you can assume the symbols that appear frequently are the A