# 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"


#: hidato.py:72
msgid "Check for errors, correct errors"
msgstr ""

#: hidato.py:72
msgid "Give hint, Apply hint"
msgstr ""

#: hidato.py:72
msgid "Left-mouse random puzzle, right-mouse next puzzle"
msgstr ""

#: hidato.py:72
msgid "Show solution"
msgstr ""

#: hidato.py:75
msgid "Exclusion rule: a solved grid of N cells contains the digits 1 to N ordered consecutively as a continuous chain of touching cells. This means that the digits 1 to N each occur exactly once. Once an answer is set all other occurrences of that digit can be deleted."
msgstr ""

#: hidato.py:75
msgid "Hidden pair: a solved grid of N cells contains the digits 1 to N ordered consecutively as a continuous chain of touching cells. This means that the digits 1 to N each occur exactly once. If two cells each contain the only remining copies of two digits, those digits must be the answers for the two cells, and any other candidates in those cells can be deleted."
msgstr ""

#: hidato.py:75
msgid "Hidden single: a solved grid of N cells contains the digits 1 to N ordered consecutively as a continuous chain of touching cells. This means that the digits 1 to N each occur exactly once. If a cell contains the only remining copy of a digit, that digit must be the answer for the cell, and any other candidates in that cell can be deleted."
msgstr ""

#: hidato.py:75
msgid "Hidden triple: a solved grid of N cells contains the digits 1 to N ordered consecutively as a continuous chain of touching cells. This means that the digits 1 to N each occur exactly once. If three cells each contain the only remining copies of three digits, those digits must be the answers for the three cells, and any other candidates in those cells can be deleted."
msgstr ""

#: hidato.py:75
msgid "Naked pair: a solved grid of N cells contains the digits 1 to N ordered consecutively as a continuous chain of touching cells. This means that the digits 1 to N each occur exactly once. If two cells each contain only the same two digits, those digits must be the answers for the two cells, and any other occurrences of those digits can be deleted."
msgstr ""

#: hidato.py:75
msgid "Naked triple: a solved grid of N cells contains the digits 1 to N ordered consecutively as a continuous chain of touching cells. This means that the digits 1 to N each occur exactly once. If three cells each contain only the same three digits, those digits must be the answers for the three cells, and any other occurrences of those digits can be deleted."
msgstr ""

#: hidato.py:75
msgid "Prune on distance: a solved grid of N cells contains the digits 1 to N ordered consecutively as a continuous chain of touching cells. Once an answer, say X, is set, we know that the cells containing X-1 and X+1 must touch the cell containing X, and hence that they cannot occur further away. X-1 and X+1 can be deleted as candidates from all cells not touching the one containing X. Similarly X-2, X+2 can be deleted as candidates from all cells at least one cell futher away, and so on. The distances between cells are calculated without taking into account obstructions posed by any solved cells."
msgstr ""

#: hidato.py:75
msgid "Prune on path: a solved grid of N cells contains the digits 1 to N ordered consecutively as a continuous chain of touching cells. Once an answer, say X, is set, we know that the cells containing X-1 and X+1 must touch the cell containing X, and hence that they cannot occur further away. X-1 and X+1 can be deleted as candidates from all cells not touching the one containing X. Similarly X-2, X+2 can be deleted as candidates from all cells at least one cell futher away, and so on. The distances between cells are calculated by finding the shortest path between cells taking into account obstructions posed by any solved cells."
msgstr ""

#: hidato.py:78
msgid "The program starts with a randomly selected puzzle displayed. It shows a grid of cells, some containing numbers, including 1 and N, where N is the number of used cells in the grid. The aim is to place a chain of consecutive numbers in touching cells so that there is a continuous path between the cell containing 1 to the cell containing N. There is only one possible path. Each empty cell contains two menu buttons which will appear when the mouse cursor crosses them. Both menus show the remaining candidate answers for the cell. A selection made using the left menu will set the answer for the cell. The right menu can be used to delete/undelete candidates, the candidate 0 being used to undelete all. In the toolbar the jigsaw symbol contains a menu, the cube 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.  If the player right-clicks on the hint button, the program will repeatedly apply a simple filter until it has no effect, clearing the candidates as it goes. Hints are shown by displaying green and red menu buttons in the affected cells. Green buttons indicate the reasons for a hint and red where candidates can be deleted. Clicking on the buttons will reveal list of the candidates involved. While the hint is active (shown by the wand icon leaning backwards) clicking on the wand with the middle mouse button will cause a pop-up to appear containing a short explanation of the hint. The slider at the base of the display enables the player to see which candidates remain in which cells. The game includes 3 blocks of 1000 puzzles. The first block are square cells and these touch orthogonally. The second block contains grids of hexagonal cells and each cell touches it 6 neighbours. The last block contains square cells and these touch orthogonally and diagonally."
msgstr ""

#: hidato.py:82
msgid "Shade cells"
msgstr ""

#: hidato.py:83
msgid "Shade on"
msgstr ""

#: hidato.py:84
msgid "Shade off"
msgstr ""

#: hidato.py:91
msgid "Set Animation Delay"
msgstr ""

#: hidato.py:100
msgid "Set Prune Distance"
msgstr ""

#: hidato.py:107
msgid "Font Size"
msgstr ""

#: hidato.py:139
msgid "Save Settings"
msgstr ""

#: hidato.py:146
msgid "Help"
msgstr ""

#: hidato.py:153
msgid "About"
msgstr ""

