{"id":2451,"date":"2021-06-19T20:21:57","date_gmt":"2021-06-19T14:51:57","guid":{"rendered":"https:\/\/www.rangakrish.com\/?p=2451"},"modified":"2021-06-19T20:21:57","modified_gmt":"2021-06-19T14:51:57","slug":"snake-and-ladder-game-in-prolog","status":"publish","type":"post","link":"https:\/\/www.rangakrish.com\/index.php\/2021\/06\/19\/snake-and-ladder-game-in-prolog\/","title":{"rendered":"Snake and Ladder Game in Prolog"},"content":{"rendered":"

Snake and Ladder<\/strong><\/em><\/a>\u00a0is a popular game that originated in India<\/strong><\/em> and later spread to other parts of the world. Even now it is a hit among kids in South India<\/strong><\/em>, where people use the traditional game board, coins and dice.\u00a0<\/span><\/p>\n

Last week, I had a chance to play this game with my 5-year-old granddaughter, who was visiting us, and it was great fun! A wonderful way to relax in the present stressful Covid situation!<\/p>\n

After she left, I decided to implement the game in Prolog<\/strong><\/em>. Today’s article is about the implementation. I will share the source code at the end of the article.<\/p>\n

Here is the game board.<\/p>\n

\"Snake-And-Ladder<\/a>
Snake-And-Ladder Game Board<\/strong><\/figcaption><\/figure>\n

There are 100 “Cells”<\/strong><\/em> numbered 1 to 100. There are a few\u00a0Snakes<\/strong><\/em> and Ladders<\/strong><\/em>\u00a0that connect cell pairs. When a player reaches a cell that has the head of a snake, he will have to slide down the snake and move to the cell that has the tip of the tail. On the other hand, if a player reaches the bottom of a ladder, he has to climb up the ladder and reach the cell at the top of the ladder.<\/p>\n

Usually 3 or 4 players play the game, but 2 is the minimum. At the start of the game, players agree upon the order in which they will play. The game board we used came with two traditional metal dice. In order to “open”<\/strong><\/em> the game, a player must get “1”<\/strong><\/em> when rolling the dice. If he gets 5, 6 or 12, then he will roll the dice again. Any other value (2, 3, 4) will transfer control to the next player in the agreed order.<\/p>\n

The first player to reach 100, or cross it, is the winner (by the way, there are minor variations of the game, but what I present is what I played).<\/p>\n

Here is the code that defines the board:<\/p>\n

\"Configuring<\/a>
Configuring the Board<\/strong><\/figcaption><\/figure>\n

I could have hard-coded the start and end positions as 1 and 100 respectively, but I chose to keep it flexible.<\/p>\n

How to model the dice and rolling the dice? Here is the code fragment:<\/p>\n

\"Modelling<\/a>
Modelling the Dice<\/strong><\/figcaption><\/figure>\n

Deciding the order in which the players will play and choosing the “next”<\/strong><\/em> player at any point in time are handled by the following clauses:<\/p>\n

\"Selecting<\/a>
Selecting Players in Order<\/strong><\/figcaption><\/figure>\n

Initialization and the main “play”<\/strong><\/em> loop are given below:<\/p>\n

\"The<\/a>
The Main Loop<\/strong><\/figcaption><\/figure>\n

The logic to handle specific dice values when a player rolls the dice is implemented in these clauses:<\/p>\n

\"Handling<\/a>
Handling Dice Values<\/strong><\/figcaption><\/figure>\n

Moving the coin and associated special handling for snakes and ladders is shown below:<\/p>\n

\"Moving<\/a>
Moving the Coin from One Cell to Another<\/strong><\/figcaption><\/figure>\n

I have covered the core logic. Let us run the program and see how it performs. I have implemented this program in Sicstus prolog 4.6.0<\/strong><\/em> on my Windows 10<\/strong><\/em> machine.\u00a0 <\/span>Here is the output generted when I run the game in the IDE<\/strong><\/em>:<\/p>\n

\"Sample<\/a>
Sample Output<\/strong><\/figcaption><\/figure>\n

What is weird in this case is that only “p2”<\/strong><\/em> managed to open the game. The other two did not get the mandatory “1”<\/strong><\/em> to open the game. Because of randomness in selecting players and rolling the dice, the output is likely to change each time we run the program. Here is another run:<\/p>\n

\"Another<\/a>
Another Run<\/strong><\/figcaption><\/figure>\n

Fortunately, in this run, all three players managed to open the game, but “p1”<\/strong><\/em> won finally.<\/p>\n

Well, it was interesting to implement the game in Prolog<\/strong><\/em>! You can download the source here<\/strong><\/em><\/a>.<\/p>\n

Have a nice weekend!<\/p>\n","protected":false},"excerpt":{"rendered":"

Snake and Ladder\u00a0is a popular game that originated in India and later spread to other parts of the world. Even now it is a hit among kids in South India, where people use the traditional game board, coins and dice.\u00a0 Last week, I had a chance to play this game with my 5-year-old granddaughter, who […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"advanced_seo_description":"","jetpack_seo_html_title":"","jetpack_seo_noindex":false,"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[17,147],"tags":[285,148,284],"class_list":["post-2451","post","type-post","status-publish","format-standard","hentry","category-programming","category-prolog","tag-game","tag-prolog","tag-snake-and-ladder"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p9OLnF-Dx","jetpack-related-posts":[{"id":3555,"url":"https:\/\/www.rangakrish.com\/index.php\/2024\/11\/22\/multiobjective-optimization-moo-in-lisp-and-prolog\/","url_meta":{"origin":2451,"position":0},"title":"Multiobjective Optimization (MOO) in Lisp and Prolog","author":"admin","date":"November 22, 2024","format":false,"excerpt":"Recently I came across a nice article\u00a0by Jose Crespo, where the author stresses that the future of programming revolves around the application of math concepts such as Functor, Monads, Folds, etc. In addition, he argues that familiarity with C\/C++ is essential in this modern AI age. The author goes through\u2026","rel":"","context":"In "C++"","block_context":{"text":"C++","link":"https:\/\/www.rangakrish.com\/index.php\/category\/c\/"},"img":{"alt_text":"Lisp Code for Pareto Front","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2024\/11\/lisp-code-249x300.jpg?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]},{"id":2922,"url":"https:\/\/www.rangakrish.com\/index.php\/2022\/10\/06\/why-learn-prolog\/","url_meta":{"origin":2451,"position":1},"title":"Why Learn Prolog?","author":"admin","date":"October 6, 2022","format":false,"excerpt":"There are several programming languages in use today and a simple google search will throw up interesting recommendations of a subset of these languages to learn, usually based on popularity ranking. As is expected, the popularity of a programming language varies over time and hence a language that was in\u2026","rel":"","context":"In "Programming"","block_context":{"text":"Programming","link":"https:\/\/www.rangakrish.com\/index.php\/category\/programming\/"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":3260,"url":"https:\/\/www.rangakrish.com\/index.php\/2023\/11\/26\/generating-polynomials-in-prolog\/","url_meta":{"origin":2451,"position":2},"title":"Generating Polynomials in Prolog","author":"admin","date":"November 26, 2023","format":false,"excerpt":"Polynomial is an important topic in High School maths curriculum. There are many online courses that explain the topic in great details with lots of examples and sample exercises. Wouldn\u2019t it be interesting if we can generate polynomials of given degree programmatically? It turns out that this is not such\u2026","rel":"","context":"In "Programming"","block_context":{"text":"Programming","link":"https:\/\/www.rangakrish.com\/index.php\/category\/programming\/"},"img":{"alt_text":"Generating Polynomials - Main Clauses","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2023\/11\/Code1-300x163.jpg?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2023\/11\/Code1-300x163.jpg?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2023\/11\/Code1-300x163.jpg?resize=525%2C300&ssl=1 1.5x"},"classes":[]},{"id":2832,"url":"https:\/\/www.rangakrish.com\/index.php\/2022\/06\/12\/definite-clause-grammars-in-lisp-part-4\/","url_meta":{"origin":2451,"position":3},"title":"Definite Clause Grammars in Lisp – Part 4","author":"admin","date":"June 12, 2022","format":false,"excerpt":"In a series of articles\u00a0written earlier, I had shown how it is possible to model Definite Clause Grammars (DCG) in LispWorks Lisp (Enterprise Edition). We use defgrammar\u00a0in Common Prolog (available as part of KnowledgeWorks package) to define our grammar rules. Here is a toy English grammar represented using defgrammar: This\u2026","rel":"","context":"In "LISP"","block_context":{"text":"LISP","link":"https:\/\/www.rangakrish.com\/index.php\/category\/lisp\/"},"img":{"alt_text":"DCG Using Defgrammar","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2022\/06\/defgrammar-version-300x177.jpg?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2022\/06\/defgrammar-version-300x177.jpg?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2022\/06\/defgrammar-version-300x177.jpg?resize=525%2C300&ssl=1 1.5x"},"classes":[]},{"id":1727,"url":"https:\/\/www.rangakrish.com\/index.php\/2019\/09\/15\/exploring-word-patterns\/","url_meta":{"origin":2451,"position":4},"title":"Exploring Word Patterns","author":"admin","date":"September 15, 2019","format":false,"excerpt":"Working with word patterns can be an exciting (and challenging) creative activity. Such patterns come into picture while playing word games, solving word puzzles or even writing poetry. It is precisely to facilitate such tasks that I am building my \"iLexicon\" system.\u00a0 One popular word game goes like this: The\u2026","rel":"","context":"In "Natural Language Processing"","block_context":{"text":"Natural Language Processing","link":"https:\/\/www.rangakrish.com\/index.php\/category\/natural-language-processing\/"},"img":{"alt_text":"Prolog Predicates for Word Pair Generation","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2019\/09\/Code.jpg?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2019\/09\/Code.jpg?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2019\/09\/Code.jpg?resize=525%2C300&ssl=1 1.5x"},"classes":[]},{"id":3573,"url":"https:\/\/www.rangakrish.com\/index.php\/2024\/12\/17\/using-prolog-to-solve-the-word-transformation-puzzle\/","url_meta":{"origin":2451,"position":5},"title":"Using Prolog to Solve the Word Transformation Puzzle","author":"admin","date":"December 17, 2024","format":false,"excerpt":"In today\u2019s article, I want to share an interesting word puzzle, and then show how to solve it in Prolog. Here is the puzzle: You are given two words of the same length. You have to transform the first word into the second word, by changing only one letter at\u2026","rel":"","context":"In "Programming"","block_context":{"text":"Programming","link":"https:\/\/www.rangakrish.com\/index.php\/category\/programming\/"},"img":{"alt_text":"Our Dictionary","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2024\/12\/prolog1-300x280.jpg?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]}],"_links":{"self":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/2451","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/comments?post=2451"}],"version-history":[{"count":0,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/2451\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/media?parent=2451"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/categories?post=2451"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/tags?post=2451"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}