Traditional marble game using ant colony optimization / Muhammad Izzat Imran Che Isa

The traditional marble game is a stochastic game which is has random probability of distribution or pattern that may be analysed statistically but not be predicted precisely. It need to target which marble is the most suitable to shot accurately. The study of traditional marble game will be implemen...

全面介绍

Saved in:

书目详细资料
主要作者:	Che Isa, Muhammad Izzat Imran
格式:	Thesis
语言:	English
出版:	2017
主题:	Instruments and machines Computer software Application program interfaces Configuration management Software measurement Algorithms Database management
在线阅读:	https://ir.uitm.edu.my/id/eprint/69623/1/69623.pdf
标签:	添加标签没有标签, 成为第一个标记此记录!

id	my-uitm-ir.69623
record_format	uketd_dc
spelling	my-uitm-ir.696232022-11-02T06:50:52Z Traditional marble game using ant colony optimization / Muhammad Izzat Imran Che Isa 2017-01 Che Isa, Muhammad Izzat Imran Instruments and machines Electronic Computers. Computer Science Evolutionary programming (Computer science). Genetic algorithms Computer software Application program interfaces Configuration management Development. UML (Computer science) Software measurement Algorithms Database management The traditional marble game is a stochastic game which is has random probability of distribution or pattern that may be analysed statistically but not be predicted precisely. It need to target which marble is the most suitable to shot accurately. The study of traditional marble game will be implemented in a game prototype using Ant Colony Optimization (ACO). ACO technique is used for searching method in order to find the nearest marble that can be selected to be shot. Instead of get random value of position, ACO helps to optimize the nearest marble. Collision detection technique is one of a physic law that manipulate the movement and position of marble. The prototype is evaluated based on distance between initial position and selected marble position. The shortest distance is defined as best result. A set of data contains position of marbles is tested for ACO algorithm in the prototype. As the result, the accuracy of the shortest distance is moderate because number of marbles limited to fifty marbles. The more number of marbles, the higher the search accuracy. In future, traditional marble game can be applied with other search algorithm to optimize the solution 2017-01 Thesis https://ir.uitm.edu.my/id/eprint/69623/ https://ir.uitm.edu.my/id/eprint/69623/1/69623.pdf text en public degree Universiti Teknologi MARA, Terengganu Faculty of Computer and Mathematical Sciences Syed Yasin, Sharifah Nurulhikmah
institution	Universiti Teknologi MARA
collection	UiTM Institutional Repository
language	English
advisor	Syed Yasin, Sharifah Nurulhikmah
topic	Instruments and machines Instruments and machines Instruments and machines Computer software Application program interfaces Configuration management Instruments and machines Software measurement Algorithms Database management
spellingShingle	Instruments and machines Instruments and machines Instruments and machines Computer software Application program interfaces Configuration management Instruments and machines Software measurement Algorithms Database management Che Isa, Muhammad Izzat Imran Traditional marble game using ant colony optimization / Muhammad Izzat Imran Che Isa
description	The traditional marble game is a stochastic game which is has random probability of distribution or pattern that may be analysed statistically but not be predicted precisely. It need to target which marble is the most suitable to shot accurately. The study of traditional marble game will be implemented in a game prototype using Ant Colony Optimization (ACO). ACO technique is used for searching method in order to find the nearest marble that can be selected to be shot. Instead of get random value of position, ACO helps to optimize the nearest marble. Collision detection technique is one of a physic law that manipulate the movement and position of marble. The prototype is evaluated based on distance between initial position and selected marble position. The shortest distance is defined as best result. A set of data contains position of marbles is tested for ACO algorithm in the prototype. As the result, the accuracy of the shortest distance is moderate because number of marbles limited to fifty marbles. The more number of marbles, the higher the search accuracy. In future, traditional marble game can be applied with other search algorithm to optimize the solution
format	Thesis
qualification_level	Bachelor degree
author	Che Isa, Muhammad Izzat Imran
author_facet	Che Isa, Muhammad Izzat Imran
author_sort	Che Isa, Muhammad Izzat Imran
title	Traditional marble game using ant colony optimization / Muhammad Izzat Imran Che Isa
title_short	Traditional marble game using ant colony optimization / Muhammad Izzat Imran Che Isa
title_full	Traditional marble game using ant colony optimization / Muhammad Izzat Imran Che Isa
title_fullStr	Traditional marble game using ant colony optimization / Muhammad Izzat Imran Che Isa
title_full_unstemmed	Traditional marble game using ant colony optimization / Muhammad Izzat Imran Che Isa
title_sort	traditional marble game using ant colony optimization / muhammad izzat imran che isa
granting_institution	Universiti Teknologi MARA, Terengganu
granting_department	Faculty of Computer and Mathematical Sciences
publishDate	2017
url	https://ir.uitm.edu.my/id/eprint/69623/1/69623.pdf
_version_	1783735897593741312

Traditional marble game using ant colony optimization / Muhammad Izzat Imran Che Isa

相似书籍