Skip to content

Translations update from Hosted Weblate #691

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.

Sign up for GitHub

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

Merged
x-sheep merged 3 commits into from
Mar 22, 2026
Merged

Translations update from Hosted Weblate #691

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
730cda6
Translated using Weblate (English)
x-sheep Mar 17, 2026
598d003
Translated using Weblate (English)
x-sheep Mar 21, 2026
3ac7c63
Translated using Weblate (English)
x-sheep Mar 20, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 2 additions & 0 deletions src-ui/res/history.en.yaml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -232,3 +232,5 @@ marutaring: This genre first appeared in Puzzle Communication Nikoli vol. 181.
bhaibahan: This genre was invented by Prasanna Seshadri.
heavydots: This genre was invented by Prasanna Seshadri.
tetroctb: This genre first appeared in Puzzle Communication Nikoli vol. 181.
kissing: This genre was invented by Matej Uher.
topo: This genre was invented by Michael Lefkowitz a.k.a. juggler.
6 changes: 6 additions & 0 deletions src-ui/res/rules.en.yaml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -415,3 +415,9 @@ tetroctb: |-
3. Each tetromino must cross at least one region border.
4. Two tetrominoes which touch each other at the corners must have different shapes, counting rotations and reflections as the same.
5. All tetrominoes form a diagonally contiguous area.
topo: |-
Divide the grid into regions, then assign a number to each region. Some region borders are given.
1. The numbers in adjacent regions must have a difference of exactly one.
2. Region borders cannot branch off or cross.
3. A clue shows the average of the numbers in the two adjacent regions.
4. Given borders must divide two regions. There can not be any dead ends.
Loading