Sudoku puzzles often seen in magazines and newspapers are logic based where each entry within the puzzle is comprised of symbols adhering to row, column, and box constraints. Previously, we had investigated their potential in frequency hopped waveforms to achieve desirable radar ambiguity functions and compared them with random as well as the more familiar Costas sequences. This paper further examines the properties of Sudoku codes through computational search and analysis. We use the co-hit array, defined as the correlation between two sequences, to quickly and efficiently evaluate thousands of Sudoku puzzles. Additionally, we look at the application of Sudoku puzzles to beam steering in planar antenna arrays and compare them to random permutations.