<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd" xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>00000ctmaa22000003a 4500</leader>
  <controlfield tag="001">UP-1685675941123923322</controlfield>
  <controlfield tag="003">Buklod</controlfield>
  <controlfield tag="005">20151015111129.0</controlfield>
  <controlfield tag="006">aa    rb   |||1 u|</controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">151015s        xx     d     r    |||| u|</controlfield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(iLib)UPTAC-00017720436</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">UPVTC</subfield>
  </datafield>
  <datafield tag="041" ind1="0" ind2=" ">
   <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2="0">
   <subfield code="a">LG 993.5 2010 C66</subfield>
   <subfield code="b">R66</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Romero, Victor II M.</subfield>
   <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Harmonetris</subfield>
   <subfield code="b">Tetris AI Optimization using Harmony Search algorithm</subfield>
   <subfield code="c">Victor M. Romero II and Leonel L. Tomes.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
   <subfield code="c">2010.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">[4], 106 leaves</subfield>
   <subfield code="b">illustrations.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
   <subfield code="a">Undergraduate thesis (B.S. Computer Science) -- University of the Philippines, Tacloban.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">Harmony Search (HS) algorithm, a relatively recent meta-heuristic optimization algorithm based on the music improvisation process of musicians, is applied to one of today's most appealing problems in the field of computer science, Tetris. Harmony search algorithm was used as the underlying optimization algorithm to facilitate the learning process of an intelligent agent whose objective is to play the game of Tetris in the most optimal way possible. The application of harmony search algorithm to Tetris is a good illustration of the involvement of optimization process to decision making problems. Experiment results show that harmony search found the best possible solution for the problem at hand in a reasonable amount of time and cycle.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Harmony Search algorithm.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Tetris.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Intelligent agent.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Artificial intelligence.</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Tomes, Leonel L.</subfield>
   <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">FI</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">UP</subfield>
  </datafield>
  <datafield tag="852" ind1="0" ind2=" ">
   <subfield code="a">UPTAC</subfield>
   <subfield code="b">UPTAC</subfield>
   <subfield code="h">LG 993.5 2010 C66</subfield>
   <subfield code="i">R66</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
   <subfield code="a">Thesis</subfield>
  </datafield>
 </record>
</collection>
