Farhannr28 / Tucil3_13522037

Java based Word Ladder Solver Using UCS, Greedy Best First Search, and A*

Word Ladder Solver

Tucil 3 IF2211 Strategi Algoritma

Report Bug · Request Feature

Description

Word ladder (also known with many names such as Doublets, word-links, change-the-word puzzles, paragrams, laddergrams, or word golf) is one of the famous word puzzles. Word ladder was first invented by Lewis Carroll, a writer and mathematician, back in 1877. The puzzle starts with 2 words, to solve the puzzle one must find a chain of other words to link the two, in which two succesive words must differ by one letter only. This Java program can find the optimal (for most cases) solution for any solvable game of Word Ladder. 3 different algorithms are provided to be used including Uniform Cost Search, Greedy Best First Search, and A*.

Table of Contents

Table of Contents

1. Description
2. Getting Started
   • Prerequisites
   • Installation
   • How to Use
   • Features

     1. Features - 1
     2. Features - 2
     3. Features - 3
3. Author

External Links

• Spesifikasi
• Laporan

(back to top)

Getting Started

Prerequisites

Project dependencies

• Java at least Java 18
  https://www.java.com/en/download/

(back to top)

Installation

1. Clone the repo

   git clone github.com/Farhannr28/Tucil3_13522037

2. Build java file

   cd src
   javac *.java -d ../bin

3. Run the program

   cd ../bin
   java src.Main

(back to top)

How to Use

1. Enter the origin and target word in the dialogue provided

2. Select the search algorithm (UCS/Greedy BFS/A*)

3. The solution will be displayed

4. Answer if you want to try another word or close program (Yes/No)

(back to top)

Features

• Input origin and target word
• Run Uniform Cost Search
• Run Greedy Best First Search
• Run A* Search
• Shows solution path
• Shows time taken (in milliseconds)
• Shows amount of node visited

(back to top)

Author

  Name  : Farhan Nafis Rayhan
  NIM   : 13522037
  Email : [e-mail]

(back to top)