# SOME DESCRIPTIVE TITLE.
# Copyright (C) YEAR ORGANIZATION
# FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
#
msgid ""
msgstr ""
"Project-Id-Version: PACKAGE VERSION\n"
"POT-Creation-Date: 2018-05-15 16:22+BST\n"
"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
"Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
"Language-Team: LANGUAGE <LL@li.org>\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"
"Generated-By: pygettext.py 1.5\n"


#: akari.py:70
msgid "Algorithm 0: any black cell containing a 0 can be blocked on all sides."
msgstr ""

#: akari.py:70
msgid "Algorithm 10: When a 2 is blocked on one side and is not touching any bulbs, a bulb on two of its adjacent diagonals would prevent it from being satisfied. Therefore these diagonals cannot be bulbs."
msgstr ""

#: akari.py:70
msgid "Algorithm 11: When a 2 touching no bulbs is blocked on one side and is also diagonally adjacent to an unsatisfied 1, only one bulb can be placed touching the 2 and the 1. So the unblocked cell not touching the 1 must be a bulb."
msgstr ""

#: akari.py:70
msgid "Algorithm 12: When a 2 touching no bulbs is diagonally adjacent to a cell requiring one more bulb, and that bulb must touch the 2, the other bulb for the 2 must be placed on one of its other two sides. A bulb on their bisecting diagonal would block both of these possibilities, hence this diagonal cell can be blocked."
msgstr ""

#: akari.py:70
msgid "Algorithm 13: When a 2 and a 1 are adjacent and neither touches any bulbs and the 1 is blocked on the side distal from the 2, then the 2 cannot be satisfied by bulbs which would block the 1. So the cell on the side of the 2 distal from the 1 must be a bulb."
msgstr ""

#: akari.py:70
msgid "Algorithm 14: This algorithm looks for cells which if bulbed would block the only way to light another cell. Any such cells can be blocked."
msgstr ""

#: akari.py:70
msgid "Algorithm 15: When a 2 and a 1 are diagonally adjacent and the 2 is blocked on a side distal to the 1, two of the three unblocked cells next to the 2 are also next to the 1. The 2 requires two bulbs and to avoid having two bulbs next to the 1 the cell not touching the 1 must be a bulb."
msgstr ""

#: akari.py:70
msgid "Algorithm 16: When a cell requires one more bulb which can only be placed in one of two places, any cell which if bulbed would block both of these places cannot be a bulb."
msgstr ""

#: akari.py:70
msgid "Algorithm 17: When two 2s are diagonally adjacent and one of them requires only one more bulb, that bulb will be shared with the other 2 and that 2 must have a bulb on its other side."
msgstr ""

#: akari.py:70
msgid "Algorithm 18: When two 2s are diagonally adjacent and one of them requires only one more bulb, that bulb will be shared with the other 2 and that 2 must have a bulb on its other side."
msgstr ""

#: akari.py:70
msgid "Algorithm 19: This algorithm looks for cells which if bulbed would block the only way to light another cell. Any such cells can be blocked."
msgstr ""

#: akari.py:70
msgid "Algorithm 1: If a cell has number N and only N neighbours that can be bulbed, then they are all bulbs."
msgstr ""

#: akari.py:70
msgid "Algorithm 2: If a cell is unlit and can only be lit by itself, it must be a bulb."
msgstr ""

#: akari.py:70
msgid "Algorithm 3: If a cell has number 3 then no bulb can occupy its adjacent diagonals as each would block bulbs along two sides and so it could never be satisfied."
msgstr ""

#: akari.py:70
msgid "Algorithm 4: If a cell can only be lit by one cell, that cell must be a bulb."
msgstr ""

#: akari.py:70
msgid "Algorithm 5: If a cell has number 1 and has two unbulbable adjacent cells arranged diagonally to one another, then no bulb can occupy the cell on the opposite diagonal because it would block both of the 1s possible bulb placements."
msgstr ""

#: akari.py:70
msgid "Algorithm 6: When two unsatisfied 1s are arranged on diagonally adjacent cells and one of them has only two remaining unlit cells, both of which would also satisfy the other 1, one of those two unlit cells must contain a bulb. This bulb will satisfy both 1s and so no other cells touching the 1s can contain a bulb."
msgstr ""

#: akari.py:70
msgid "Algorithm 7: When a 3 requires one more bulb and on an adjacent diagonal has a cell also requiring one more bulb, then one of the two empty cells adjacent to the 3 must satisfy both. Therefore any other unlit cells around  the unsatisfied cell can be blocked."
msgstr ""

#: akari.py:70
msgid "Algorithm 8: When on an adjacent diagonal a 3 has a cell requiring one more bulb, and this bulb can only be next to the 3, we know that the other two cells touching the 3 must be bulbs."
msgstr ""

#: akari.py:70
msgid "Algorithm 9: When a 2 with one touching bulb and an unsatisfied 1 are diagonally adjacent and the 2 must be satisfied with a bulb which also touches the 1, any other cells touching the 1 can be blocked."
msgstr ""

#: akari.py:74
msgid "Left-mouse random puzzle, right-mouse next puzzle"
msgstr ""

#: akari.py:75
msgid "Give hint, Apply hint"
msgstr ""

#: akari.py:76
msgid "Check for errors, correct errors"
msgstr ""

#: akari.py:77
msgid "Show solution"
msgstr ""

#: akari.py:81
msgid "Place light bulbs so that every white square on the board is lit and all the numbered squares are vertically and horizontally contiguous with exactly their given number of light bulbs. No light bulb can be illuminated by another and there is only one solution to each puzzle. Bulbs are placed using a left mouse click. Cells can be marked as blocked using a right mouse click. Middle mouse undoes a bulb or a block. In the toolbar the jigsaw symbol contains a menu, the PZL Akari symbol starts a new game; the wand requests a hint, a second click on the wand will perform the hint operation; the thumb checks if the puzzle contains any errors and a second click will clear the errors; the sad smiley shows the solution; the entrybox shows the current puzzle number and can be used to select a new puzzle number; the number next to the puzzle number is the puzzle difficulty score. The clock ticks every 5 seconds but will be replaced by the algorithm number if a hint is requested. The program contains 20 solving algorithms numbered 0 - 19, ordered very roughly on their complexity, so that low numbered algorithms are easier to understand/apply than those with high numbers. The font size option in the menu can be used to change the size of the display. The game contains 5 blocks of 100 puzzles with sizes 12x10, 18x12, 20x18, 24x20, 36x20, numbered sequentially from 0 to 499. Within each block of a 100 the puzzles are ordered by their difficulty score, easiest first."
msgstr ""

#: akari.py:85
msgid "Font Size"
msgstr ""

#: akari.py:116
msgid "Save Settings"
msgstr ""

#: akari.py:123
msgid "Help"
msgstr ""

#: akari.py:130
msgid "About"
msgstr ""

