Daftar Isi: Anagrams Solver Using Backtracking Algorithm

Main Author:	Atmaja, Arif
Format:	Thesis NonPeerReviewed Book
Bahasa:	eng
Terbitan:	, 2012
Subjects:	Computer programming programs & data
Online Access:	http://repository.unika.ac.id/7721/1/06.02.0018%20Arif%20Atmaja%20COVER.pdf http://repository.unika.ac.id/7721/2/06.02.0018%20Arif%20Atmaja%20BAB%20I.pdf http://repository.unika.ac.id/7721/3/06.02.0018%20Arif%20Atmaja%20BAB%20II.pdf http://repository.unika.ac.id/7721/4/06.02.0018%20Arif%20Atmaja%20BAB%20III.pdf http://repository.unika.ac.id/7721/5/06.02.0018%20Arif%20Atmaja%20BAB%20IV.pdf http://repository.unika.ac.id/7721/6/06.02.0018%20Arif%20Atmaja%20BAB%20V.pdf http://repository.unika.ac.id/7721/7/06.02.0018%20Arif%20Atmaja%20BAB%20VI.pdf http://repository.unika.ac.id/7721/8/06.02.0018%20Arif%20Atmaja%20DAFTAR%20PUSTAKA.pdf http://repository.unika.ac.id/7721/

Daftar Isi:

Anagrams is one type of word play, in which the letters in the word input were randomized to form other words. and in this case, the authors find a solution to look for possible words formed. Backtracking algorithm is used to optimize the search process that formed the word in the dictionary. Keyword : Anagrams, Backtracking.