<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-03-17T03:30:53Z</responseDate>
  <request metadataPrefix="oai_dc" verb="GetRecord" identifier="oai:ipsj.ixsq.nii.ac.jp:00097723">https://ipsj.ixsq.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:ipsj.ixsq.nii.ac.jp:00097723</identifier>
        <datestamp>2025-01-21T12:44:40Z</datestamp>
        <setSpec>6164:6165:6210:7369</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>A simple and rapid Lights-up solver</dc:title>
          <dc:title>A simple and rapid Lights-up solver</dc:title>
          <dc:creator>YenShi-Jim</dc:creator>
          <dc:creator>ChiuShih-Yuan</dc:creator>
          <dc:creator>Yen, Shi-Jim</dc:creator>
          <dc:creator>Chiu, Shih-Yuan</dc:creator>
          <dc:description>This paper proposed a solver mixing pattern matching method with local search to solve lights-up puzzle games. First, use the rule of thumb to deal with some part of the region in a very short time. Then, use the local search method to complement the part in which the former method is not able to solve. After authenticating our method by solving the problems collected from Internet and comparing with other papers, the conclusion demonstrates that our approach is fast and efficient.</dc:description>
          <dc:description>This paper proposed a solver mixing pattern matching method with local search to solve lights-up puzzle games. First, use the rule of thumb to deal with some part of the region in a very short time. Then, use the local search method to complement the part in which the former method is not able to solve. After authenticating our method by solving the problems collected from Internet and comparing with other papers, the conclusion demonstrates that our approach is fast and efficient.</dc:description>
          <dc:description>conference paper</dc:description>
          <dc:publisher>情報処理学会</dc:publisher>
          <dc:date>2009-11-06</dc:date>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>ゲームプログラミングワークショップ2009論文集</dc:identifier>
          <dc:identifier>12</dc:identifier>
          <dc:identifier>2009</dc:identifier>
          <dc:identifier>67</dc:identifier>
          <dc:identifier>70</dc:identifier>
          <dc:identifier>https://ipsj.ixsq.nii.ac.jp/record/97723/files/IPSJ-GPWS2009010.pdf</dc:identifier>
          <dc:language>eng</dc:language>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
