print

Comparative Study of Greedy Backtracking and Branch-and-Bound Algorithms in a Puzzle Game

---

Many real problems, for example: scheduling, study planner, traveling salesmen problem, etc. are similar to a puzzle game.nnThe goal of this thesis is to show the comparative study of greedy, backtracking, and branch-and-bound algorithms. The author implements those algorithms using C language in a puzzle game.nnFinding corresponding books is done for the first time. Then description of all algorithms is written, i.e.: greedy, backtracking, and branch-and-bound.nnIn design, original card that require pictures is changed in number, rule of the game is explained, and also algorithms module of the programs that will be used in programming language. There are some illustrations in those algorithms, i.e.: backtracking tree, branch-and-bound tree.nnThen, comparative report about the three algorithms will be shown, and analyse result is stated.n

nNotes: CD is not available

---

Availability

M00013

(wh)

Available

Detail Information

Series Title

-

Call Number

13

Publisher

: Swiss German University., 2002

Collation

-

Language

English

ISBN/ISSN

-

Classification

-

Content Type

-

Media Type

-

Carrier Type

-

Edition

-

Subject(s)

MIT

Specific Detail Info

-

Statement of Responsibility

-

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment