• Spesifikasi
• QNA
• Laporan

(back to top)

For Tugas Kecil 3 IF2211 Strategi Algoritma, I was tasked to make a solver for Word Ladder Game. I made 3 algorithm of choice to solve the problem. Uniform Cost Search (UCS), Greedy Best First Search (GBFS) and A* (A star). I used Java Swing to make a simple GUI with input validation to make solver better.

I learned a lot through this project, especially regarding pros and cons of each algorithm. I also learnt many similarities between these algorithms and their differences as well.

(back to top)

Project dependencies

• Java 22
  https://www.java.com/en/download/

(back to top)

1. Clone the repo

   git clone https://github.com/NoHaitch/Tucil3_13522091

2. Build java file

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

3. Run the program

   cd ../bin
   java Main

Note:
Use run-bat.bat or run-sh.sh for ease of use

(back to top)

Note: Program will use dictionary.txt in the dictionary directory for the English dictionary representation. Dictionary.txt is not a perfect dictionary and may loss some English words.

1. Use run-bat.bat or run-sh.sh to run and build the program
2. Input Source Word
3. Input Target Word
4. Press one of the three buttons:
   • Uniform Cost Search
   • Greedy Best First Search
   • A*
5. Result is shown in a new window

(back to top)

(back to top)

If you want to contribute or further develop the program, please fork this repository using the branch feature.
Pull Request is permited and warmly welcomed

(back to top)

The code in this project is licensed under MIT license.

(back to top)