Actions

Inglenook Sidings: Difference between revisions

From Permanent Future Lab

Content added Content deleted
(Created page with "==Description== --- INFORMATION WILL BE SOON TRANSLATED --- Dit is één van de bekendste rangeerpuzzels ter wereld: de 'Inglenook Sidings' van Alan Wright (1928 - 2005).
...")
 
No edit summary
Line 1: Line 1:
[[File:IMG 3370.JPG|400px]]

Foto: Sjaak Nauta

==Description==
==Description==
--- INFORMATION WILL BE SOON TRANSLATED ---
--- INFORMATION WILL BE SOON TRANSLATED ---

Revision as of 12:25, 23 November 2015

Foto: Sjaak Nauta

Description

--- INFORMATION WILL BE SOON TRANSLATED ---

Dit is één van de bekendste rangeerpuzzels ter wereld: de 'Inglenook Sidings' van Alan Wright (1928 - 2005).
 Het verraderlijke van deze puzzel is de, op het eerste gezicht, eenvoudige opbouw met maar twee wissels en twee opstelsporen. Echter, het oplossen van deze puzzel neemt al gauw tussen de 15 en 30 minuten in beslag. Daarbij kan de te volgen strategie - die sterke overeenkomst heeft met de berekeningen die een rangeerploeg in de werkelijkheid moet uitvoeren - zeer snel complex worden.

Source Inglenook Sidings Start

Documentation & help

Community

To discuss this product with others you can visit a community site.

Development

Some products have active development. Possible a open hardware design, SDK, API, and/or open source software package is available. Did you developed for this technology? Please share it at one of the above communities or development links below. If you created a new Github page, please add it to the list below.

Sharing mentions & tags

When you discover something about this product you can make a blog, photo or video and put it on your website, blog or favorite social media platform such as Facebook, Twitter, YouTube, LinkedIn, Instagram, etc. To make your message being visible for people interesting in the Permanent Future Lab movement please use the #PFLab hashtag and also use one of the product mentions and hashtags below.

Others

Cookies help us deliver our services. By using our services, you agree to our use of cookies.