{"id":166,"date":"2020-01-20T19:11:06","date_gmt":"2020-01-20T08:41:06","guid":{"rendered":"http:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/?page_id=166"},"modified":"2020-01-20T19:11:06","modified_gmt":"2020-01-20T08:41:06","slug":"snakes-and-ladders-heuristic-web-interface","status":"publish","type":"page","link":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/snakes-and-ladders-heuristic-web-interface\/","title":{"rendered":"Snakes and Ladders Heuristic – Web Interface"},"content":{"rendered":"

[vc_row][vc_column][vc_empty_space][vc_column_text]<\/p>\n

Snakes and Ladders Heuristic – Web Interface<\/h1>\n

SLHWeb is designed to find Hamiltonian cycles in large connected graphs. The interface is powered by the Snakes and Ladders Heuristic. SLHWeb has a large number of graphs built in which serve as a demonstration of the potency of the Snakes and Ladders Heuristic. Where possible, a reference has been given for the included graphs at the bottom of this page. Alternatively, you can submit your own graph (in edge-list format) to solve via SLH.<\/p>\n

There are two solving options – Start SLH and Start slow SLH. Start SLH will run SLH in real time, updating the animation as often as possible. However, note that the solving time may be slowed down if there is a heavy load on the server, and may not reflect the true solving time of SLH. Start slow SLH is a staggered version of the Snakes and Ladders Heuristic, where the speed of execution is adjustable.<\/p>\n

SLHWeb requires Java Runtime Environment to run. You can download JRE here<\/a>.<\/p>\n

If you have any questions about SLHWeb, please contact Michael Haythorpe<\/a>.<\/p>\n

JAVA RUNTIME ENVIRONMENT IS NOT INSTALLED! <\/applet><\/p>\n

Snakes and Ladders Heuristic developed by:<\/strong>
\nPouya Baniasadi
\nVladimir Ejov
\nJerzy Filar
\nMichael Haythorpe
\nSerguei Rossomakhine<\/p>\n

Snakes and Ladders Heuristic coded by:<\/strong>
\nSerguei Rossomakhine<\/p>\n

SLHWeb coded by:<\/strong>
\nKieran Clancy
\nMichael Haythorpe<\/p>\n

References for included graphs<\/strong>:<\/p>\n

Foster Graph:<\/strong>\u00a0Symmetric Cubic Graph\u00a0F<\/em>090<\/sub>\u00a0from The Foster Census [1]
\nBiggs-Smith Graph:<\/strong>\u00a0Distance-regular Symmetric Cubic Graph\u00a0F<\/em>090<\/sub>\u00a0from The Foster Census [1]
\nKnights Tour Problems: <\/strong>Non-regular graphs arising from the path of a knight on chessboard of arbitrary size\u00a0[2]
\nTSPLIB Graphs: <\/strong>HCP instances provided by University of Heidelberg [3]
\nGeneralized Petersen Graphs:<\/strong>\u00a0Graphs GP(n<\/em>,2) have only three Hamiltonian cycles whenever n<\/em> = 3 mod 6 [4]
\nSheehan Graphs:<\/strong>\u00a0These graphs have the largest number of edges possible while containing only a single Hamiltonian cycle [5]
\nFHCP Challenge Set<\/strong>: Difficult instances from a set of 1001 graph produced by FHCP. Available here<\/a>.<\/p>\n

[1] Bouwer, I.Z., Chernoff, W.W., Monson, B. and Star, Z. The Foster Census<\/em>. Charles Babbage Research Centre, 1988.<\/p>\n

[2] Weisstein, Eric W. Knight Graph.<\/em> From MathWorld–A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/KnightGraph.html<\/a><\/p>\n

[3] TSPLIB<\/em>,\u00a0http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/<\/a><\/p>\n

[4] Coxeter, H.S.M. Self-Dual Configurations and Regular Graphs.<\/em>\u00a0Bulletin of American Mathematics Society, 56:413-455, 1950.<\/p>\n

[5] Sheehan, J. Graphs with exactly one hamiltonian circuit<\/em>. Journal of Graph Theory, 1:37-43, 1977.[\/vc_column_text][vc_empty_space][\/vc_column][\/vc_row]<\/p>\n<\/div>","protected":false},"excerpt":{"rendered":"

[vc_row][vc_column][vc_empty_space][vc_column_text] Snakes and Ladders Heuristic – Web Interface SLHWeb is designed to find Hamiltonian cycles in large connected graphs. The interface is powered by the Snakes and Ladders Heuristic. SLHWeb has a large number of graphs built in which serve as a demonstration of the potency of the Snakes and Ladders Heuristic. Where possible, a […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-166","page","type-page","status-publish","hentry"],"yoast_head":"\nSnakes and Ladders Heuristic - Web Interface - Flinders Hamiltonian Cycle Project<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/snakes-and-ladders-heuristic-web-interface\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Snakes and Ladders Heuristic - Web Interface - Flinders Hamiltonian Cycle Project\" \/>\n<meta property=\"og:description\" content=\"[vc_row][vc_column][vc_empty_space][vc_column_text] Snakes and Ladders Heuristic – Web Interface SLHWeb is designed to find Hamiltonian cycles in large connected graphs. The interface is powered by the Snakes and Ladders Heuristic. SLHWeb has a large number of graphs built in which serve as a demonstration of the potency of the Snakes and Ladders Heuristic. Where possible, a […]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/snakes-and-ladders-heuristic-web-interface\/\" \/>\n<meta property=\"og:site_name\" content=\"Flinders Hamiltonian Cycle Project\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/sites.flinders.edu.au\\\/flinders-hamiltonian-cycle-project\\\/snakes-and-ladders-heuristic-web-interface\\\/\",\"url\":\"https:\\\/\\\/sites.flinders.edu.au\\\/flinders-hamiltonian-cycle-project\\\/snakes-and-ladders-heuristic-web-interface\\\/\",\"name\":\"Snakes and Ladders Heuristic - Web Interface - Flinders Hamiltonian Cycle Project\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/sites.flinders.edu.au\\\/flinders-hamiltonian-cycle-project\\\/#website\"},\"datePublished\":\"2020-01-20T08:41:06+00:00\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/sites.flinders.edu.au\\\/flinders-hamiltonian-cycle-project\\\/snakes-and-ladders-heuristic-web-interface\\\/#breadcrumb\"},\"inLanguage\":\"en-AU\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/sites.flinders.edu.au\\\/flinders-hamiltonian-cycle-project\\\/snakes-and-ladders-heuristic-web-interface\\\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/sites.flinders.edu.au\\\/flinders-hamiltonian-cycle-project\\\/snakes-and-ladders-heuristic-web-interface\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/sites.flinders.edu.au\\\/flinders-hamiltonian-cycle-project\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Snakes and Ladders Heuristic – Web Interface\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/sites.flinders.edu.au\\\/flinders-hamiltonian-cycle-project\\\/#website\",\"url\":\"https:\\\/\\\/sites.flinders.edu.au\\\/flinders-hamiltonian-cycle-project\\\/\",\"name\":\"Flinders Hamiltonian Cycle Project\",\"description\":\"\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/sites.flinders.edu.au\\\/flinders-hamiltonian-cycle-project\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-AU\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Snakes and Ladders Heuristic - Web Interface - Flinders Hamiltonian Cycle Project","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/snakes-and-ladders-heuristic-web-interface\/","og_locale":"en_US","og_type":"article","og_title":"Snakes and Ladders Heuristic - Web Interface - Flinders Hamiltonian Cycle Project","og_description":"[vc_row][vc_column][vc_empty_space][vc_column_text] Snakes and Ladders Heuristic – Web Interface SLHWeb is designed to find Hamiltonian cycles in large connected graphs. The interface is powered by the Snakes and Ladders Heuristic. SLHWeb has a large number of graphs built in which serve as a demonstration of the potency of the Snakes and Ladders Heuristic. Where possible, a […]","og_url":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/snakes-and-ladders-heuristic-web-interface\/","og_site_name":"Flinders Hamiltonian Cycle Project","twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/snakes-and-ladders-heuristic-web-interface\/","url":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/snakes-and-ladders-heuristic-web-interface\/","name":"Snakes and Ladders Heuristic - Web Interface - Flinders Hamiltonian Cycle Project","isPartOf":{"@id":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/#website"},"datePublished":"2020-01-20T08:41:06+00:00","breadcrumb":{"@id":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/snakes-and-ladders-heuristic-web-interface\/#breadcrumb"},"inLanguage":"en-AU","potentialAction":[{"@type":"ReadAction","target":["https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/snakes-and-ladders-heuristic-web-interface\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/snakes-and-ladders-heuristic-web-interface\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/"},{"@type":"ListItem","position":2,"name":"Snakes and Ladders Heuristic – Web Interface"}]},{"@type":"WebSite","@id":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/#website","url":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/","name":"Flinders Hamiltonian Cycle Project","description":"","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-AU"}]}},"_links":{"self":[{"href":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/wp-json\/wp\/v2\/pages\/166","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/wp-json\/wp\/v2\/comments?post=166"}],"version-history":[{"count":0,"href":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/wp-json\/wp\/v2\/pages\/166\/revisions"}],"wp:attachment":[{"href":"https:\/\/sites.flinders.edu.au\/flinders-hamiltonian-cycle-project\/wp-json\/wp\/v2\/media?parent=166"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}