# Thoughts on Puzzle 30 : Build-Your-Own-Sudoku

**URL:** <https://community.rapyd.net/t/thoughts-on-puzzle-30-build-your-own-sudoku/55462>\
**Category:** General\
**Tags:** open-discussion, hack-the-galaxy\
**Created:** [September 1, 2022, 9:34am UTC](https://community.rapyd.net/t/thoughts-on-puzzle-30-build-your-own-sudoku/55462 "2022-09-01T09:34:26Z")\
**Posts on this page:** 1\
**Showing post:** 21

<div class="post-metadata">

**Author:** ![Omer\_Mor](https://sea2.discourse-cdn.com/flex016/user_avatar/community.rapyd.net/omer_mor/32/8193_2.png) [@Omer\_Mor](https://community.rapyd.net/u/Omer_Mor)\
**Post date:** [September 5, 2022, 9:27pm UTC](https://community.rapyd.net/t/thoughts-on-puzzle-30-build-your-own-sudoku/55462/21 "2022-09-05T21:27:16Z")

</div>

So…

As I said - I was not able to solve the soduko itself.

BUT - each letter in the final answer is derived from a single digit of 1…9 plus some given number. This means that each letter only has a range of 9 specific letters. For example, the first letter is the (alpha-converted) top-left digit + 2. So the minimal letter is ‘C’ (1+2 = 3 → C) and the maximal letter is ‘K’ (9+2 = 11 → K).

Using this insight it’s easy to construct the following regular expression for the code word:  
`^[c..k][a..i][e..m][g..o][h..p][d..l][c..k][a..i][q..y]$`

When running this regex on an English dictionary, you get very few hits, and only one of them makes sense. And this is indeed the solution.

---

_[View the full topic](https://community.rapyd.net/t/thoughts-on-puzzle-30-build-your-own-sudoku/55462)._