|
![]() |
|
|
To download the shareware version, click here (about 1.2 Mbytes). The current version is 1.0. The price of the licensed version is $19.95. ![]() ![]() In this puzzle, your job is to deduce (using pure logic,
no guessing necessary) where the fences in the puzzle are located. Each
fence contains one fence post with a number on it, and at least one
other fence post. Fence posts are connected to their neighbors by
'rails'. The numbered fence post (which is constantly updated as you
solve the puzzle) is the number of remaining fence posts that must be
connected to that fence until the fence is completed, at which point it
shows the total number of posts in the fence. The fence posts must be
in the same column or the same row as the numbered
post. In other words, the fence can only turn corners at the numbered
post, not at any of the other posts. Every cell in the puzzle must have
a fence post, and every fence post must be connected via rails to one
and only one numbered fence post. The above images show a puzzle (left)
and its solution (right). KINT Interpreter Source CodeIf you're interested in the KINT interpreter source codes (which are mentioned on the Help page about porting the game to non-Microsoft OS's) see the KINT web page. This will NOT be of interest to you, I suspect, unless you're a programmer. REQUIREMENTS:
Contact information:
Home page: http://www.kaser.com |