-
Notifications
You must be signed in to change notification settings - Fork 0
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Added take_an_l writeup #3
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
As a reader, I'd definitely prefer to see some diagrams on the recursive process (if possible). Aside from that and the one comment, it looks good to me.
2018/csaw_quals/take_an_l/README.md
Outdated
- inductive step: if a `2^k x 2^k` square with a mark can be tiled, | ||
we tile a `2^(k + 1) x 2^(k + 1)` square by splitting it into four | ||
`2^k x 2^k` quadrants and tiling an L into quadrants which do not contain | ||
a mark already so that each contains exactly one cell comprising the L. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The wording here is a bit confusing --- just saying "tiling an L with one cell in each quadrant" as in the comments would be clearer
@tyxchen changed as directed 👍 |
lgtm 👍 |
Since the C code is long here, unlike #1 and #2, this doesn't include the code inline in the
README
. For uniformity's sake, it might make sense to change this on #1 and #2's side.