國立虎尾科技大學 |

登入

回首頁

Constructing strategies for games wi...

ProQuest Information and Learning Co.

Constructing strategies for games with simultaneous movement.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Constructing strategies for games with simultaneous movement./
作者:	Keffer, Jeremy.
面頁冊數:	1 online resource (82 pages)
附註:	Source: Dissertation Abstracts International, Volume: 77-02(E), Section: B.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9781339164373

Constructing strategies for games with simultaneous movement.
Keffer, Jeremy.

Constructing strategies for games with simultaneous movement. - 1 online resource (82 pages)

Source: Dissertation Abstracts International, Volume: 77-02(E), Section: B.

Thesis (Ph.D.)--University of Delaware, 2015.

Includes bibliographical references

From the early days of AI, computers have been programmed to play games against human players. Most of the AI work has sought to build world-champion programs to play turn-based games such as Chess and Checkers, however computer games increasingly provide for entertaining real-time play. In this dissertation, we present an extension of recursive game theory, which can be used to analyze games involving simultaneous movement. We include an algorithm which can be used to practically solve recursive games, and present a proof of its correctness. We also define a game theory of lowered expectations to deal with situations where game theory currently fails to give players a definitive strategy, and demonstrate its applicability using several example games.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9781339164373Subjects--Topical Terms:

573171
Computer science.
Index Terms--Genre/Form:

554714
Electronic books.

Constructing strategies for games with simultaneous movement.
LDR:01925ntm a2200337K 4500 001 915396
005 20180727125214.5
006 m o u
007 cr mn||||a|a||
008 190606s2015 xx obm 000 0 eng d
020 $a 9781339164373
035 $a (MiAaPQ)AAI3730247
035 $a (MiAaPQ)udel:12121
035 $a AAI3730247
040 $a MiAaPQ $b eng $c MiAaPQ
100 1 $a Keffer, Jeremy. $3 1188731
245 1 0 $a Constructing strategies for games with simultaneous movement.
264 0 $c 2015
300 $a 1 online resource (82 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 77-02(E), Section: B.
500 $a Adviser: Daniel L. Chester.
502 $a Thesis (Ph.D.)--University of Delaware, 2015.
504 $a Includes bibliographical references
520 $a From the early days of AI, computers have been programmed to play games against human players. Most of the AI work has sought to build world-champion programs to play turn-based games such as Chess and Checkers, however computer games increasingly provide for entertaining real-time play. In this dissertation, we present an extension of recursive game theory, which can be used to analyze games involving simultaneous movement. We include an algorithm which can be used to practically solve recursive games, and present a proof of its correctness. We also define a game theory of lowered expectations to deal with situations where game theory currently fails to give players a definitive strategy, and demonstrate its applicability using several example games.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
650 4 $a Mathematics. $3 527692
650 4 $a Applied mathematics. $3 1069907
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
690 $a 0405
690 $a 0364
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of Delaware. $b Computer and Information Sciences. $3 1183446
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3730247 $z click for full text (PQDT)

筆 0 讀者評論

多媒體

評論

新增評論分享你的心得

Export

取書館別