2 TD ( ) (1) Minimax Minimax () () PV(Principal Variaion) 2

Size: px
Start display at page:

Download "2 TD 2.1 2.1.1 2.1.2 0 ( ) (1) 100 8 6 2 200 2.1.3 Minimax Minimax () () PV(Principal Variaion) 2"

Transcription

1 TD TD 1.2 TD TD 3 4 1

2 2 TD ( ) (1) Minimax Minimax () () PV(Principal Variaion) 2

3 45 A 45 B 30 C 20 D E F G H I J K L M N O P Q R S T U V W X 1Minimax 1 K E F A,B,E,N PV (Negamax Form) 2 in Minimax(node_ n, in d){ in i, score = - ; if(d == 0 n == erminal) reurn Evaluae(n); for(i = 0; i < n.num_of_children; i++){ g = Minimax(n.child_node[i], d-1) score =max(score, g); } } 2Minimax (Negamax Form) 3

4 2.1.4 Alpha-Bea Alpha-Bea Minimax 3Alpha-Bea 3 G A 45 C C D Minimax 2 4 Alpha-Bea (Negamax Form) 4

5 in AlphaBea(node_ n, in d, in _, in _){ in score = - ; if(d == 0 n == erminal) reurn Evaluae(n); for(i = 0; i < n.num_of_children; i++){ score = max(score, -AlphaBea(n.child_node[i], d-1, -_, -_)); _ = max(_, score); } } if( ) reurn _; reurn score; 4Alpha-Bea 2.2 TD TD(Temporal Difference) TD TD TD(Temporal Difference) ( 1 ) TD 1 () TD TD TD TD(0) S s S V(s ) s +1 V(s +1) V(s ) V ( s ) V ( s ) + [ V ( s+ 1) V ( s )] (2) 0<1 5

6 TD(0) TD() V k ( sk ) V ( sk ) + [ V ( s+ 1 ) V ( s )] (3) 1k k (3) 01 =0 TD(0) TD 1 1 V(s ) ( ) P 2 MSE MSE( ) = s S P( s)[ V ( s) V ( s)] V (s) s 2 T = ( (1), (2),..., ( n)) V (s) ss 2 s [ V + 1 ( s ) V ( s )] 2 (4) TD(0) = [ V 1( s ) V ( s )] + = + [ V ( s ) V ( s )] V ( s ) + 1 (5) TD() k 1 [ V ( s 1) V ( s )] V ( sk ) (6) k = 1 6

7 2 5 0 e = s_ s V(s) - V(s) e e + V ( s) + e s s' s 5TD() n T V ( s) = = ( i) ( i) s i= 1 s V ( s) = (8) s 1 (7) TDLEAF() TD Principal Variaion TD() TDLEAF() 7

8 2.2.4 TD KnighCap KnighCap TD Alpha-Bea 5 [3] 5 1 8

9 (10 50 ) TDLEAF() 0.9 9

10 [-99999,99999] (9) 6 P = 1 1+ e (9) ( E) E /1000 E P( 1260) = / e 1260 = 0.78 (10) dp de = P(1 P) P E P = E i i 1 = i P(1 P) 1000 (11) (12) (6)(0,1] 20 1 ()

11 3.3 TD while(1){ } _ while(1){ if() else if(){ principal variaion principal variaion } } 7 11

12

13 3 (100 )

14

15 (3.1 ) A B C D E F G H (5 ) ~4 ( 6~9 ) 15

16 6~9 ( 1~4 ) ( )

17 5 8 ()

18 ( )

19 TDLEAF() KnighCap TD KnighCap KnighCap

20 5 5.1 TD TD

21 1 21

22 [1]Jonahan BaxerLearning To Play Chess Using Temporal Differences. [2]Richard S. Suon, Andrew G.Baro, (2000 ). [3]TD (1999 ). [4],,TD (1999 GPW 99 ). [5]Akihiro KishimooTransposiion Table Driven Scheduling for Two-Player Games, M.Sc. Thesis, Universiy of Albera (Final version), January [6],,, [7],(1998 ) 22

JA2008

JA2008 A1 1 10 vs 3 2 1 3 2 0 3 2 10 2 0 0 2 1 0 3 A2 3 11 vs 0 4 4 0 0 0 0 0 3 6 0 1 4 x 11 A3 5 4 vs 5 6 5 1 0 0 3 0 4 6 0 0 1 0 4 5 A4 7 11 vs 2 8 8 2 0 0 0 0 2 7 2 7 0 2 x 11 A5 9 5 vs 3 10 9 4 0 1 0 0 5

More information

No

No No. 1 2 No. 3 4 5 6 7 8 9 10 11 12 No. 13 14 15 16 17 18 19 20 21 22 23 24 25 26 No. 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 No. 44 45 46 47 48 49 50 51 52 No. 53 54 55 56 57 58 59 60 61 62

More information

Version C 1 2 3 4 5 1 2 3 4 5 6 7 8 9 0 A 1 2 1 3 4 5 1 1 2 1 1 1 2 4 5 6 7 8 3 1 2 C a b c d e f g A A B C B a b c d e f g 3 4 4 5 6 7 8 1 2 a b 1 2 a b 1 2 1 2 5 4 1 23 5 6 6 a b 1 2 e c d 3

More information

O157 6/23 7/4 6 25 1000 117,050 6 14:00~15:30 1 2 22 22 14:30~15:30 8 12 1 5 20 6 20 10 11 30 9 10 6 1 30 6 6 0 30 6 19 0 3 27 6 20 0 50 1 2 6 4 61 1 6 5 1 2 1 2 6 19 6 4 15 6 1 6 30 6 24 30 59

More information

  医 事 法        山口大法医 藤宮龍也

  医 事 法             山口大法医 藤宮龍也 2 ( If anything can go wrong, it will. Things go wrong in batches. MiniMax (mini) (max) ( ) - 134 135 105 149 1) 2) 3) cf. cf. - 160-214 cf. - 211 209,210-204 vs 35 37-19 217 218-202 203 cf. - ( ) 104

More information

2

2 2 3 4 5 6 7 0 10 20 30 40 50 60 70 9 10 11 12 13 14 15 86.0% 14.0% 79.5% 20.5% 60 111 16 .. 17 ** p

More information

繝励Μ繝ウ繝

繝励Μ繝ウ繝 2012. January vol.609 2 3 2012. January vol.609 4 5 2012. January vol.609 6 7 2012. January vol.609 8 9 2012. January vol.609 10 11 2012. January vol.609 12 13 2012. January vol.609 14 15 2012. January

More information

00 0 0 0 0 0 00 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.... 0........ 0 0 0 0 0 0 0 0 0 0..0..........0 0 0 0 0 0 0 0 0 0 0.... 0........ 0 0 0 0 0 0 0 0 0 0... 0...... 0... 0 0 0 0 0 0..0 0... 0 0 0 0 0.0.....0.

More information

Microsoft Word - 倫理 第40,43,45,46講 テキスト.docx

Microsoft Word - 倫理 第40,43,45,46講 テキスト.docx 6 538 ( 552 ) (1) () (2) () ( )( ) 1 vs () (1) (2) () () () ) ()() (3) () ( () 2 () () () ()( ) () (7) (8) () 3 4 5 abc b c 6 a (a) b b ()() 7 c (c) ()() 8 9 10 () 1 ()()() 2 () 3 1 1052 1051 () 1053 11

More information

untitled

untitled METAL FORM METAL FORM METAL FORM METAL FORM METAL FORM METAL FORM METAL FORM METAL FORM METAL FORM METAL FORM METAL FORM METAL FORM 01 METAL FORM METAL FORM 02 03 METAL FORM 04 METAL FORM METAL FORM METAL

More information

4.11 4 55 4.12 11 56 4.13 0 57 4.14 1 58 4.15 4 59 4.16 11 60 5 5.1 5.1 5.2 1 (1983) Q = K A I v = Q / A = K I v = v / o n o Q A L 3 T -1 I : K : LT -1 v LT -1 v LT -1 o n o 61 (3) 5.3 1 5.1 K=10-1 10-3

More information

TD 2048 TD 1 N N 2048 N TD N N N N N N 2048 N 2048 TD 2048 TD TD TD 2048 TD 2048 minimax 2048, 2048, TD, N i

TD 2048 TD 1 N N 2048 N TD N N N N N N 2048 N 2048 TD 2048 TD TD TD 2048 TD 2048 minimax 2048, 2048, TD, N i 28 2048 2048 TD Computer Players Based on TD Learning for Game 2048 and Its Two-player Variant 2048 2048 TD 2048 TD 1 N N 2048 N TD N N N N N N 2048 N 2048 TD 2048 TD TD TD 2048 TD 2048 minimax 2048, 2048,

More information

untitled

untitled NO.39 NO.39 ---------------------------------------------------------------------- http://clickanketo.com/cgi-bin/a.cgi?q00006480a20-1- -2- -3- http://clickanketo.com/cgi-bin/a.cgi?q00006577a01 http://clickanketo.com/cgi-bin/a.cgi?q00006577a72

More information

main

main 14 1. 12 5 main 1.23 3 1.230000 3 1.860867 1 2. 1988 1925 1911 1867 void JPcalendar(int x) 1987 1 64 1 1 1 while(1) Ctrl C void JPcalendar(int x){ if (x > 1988) printf(" %d %d \n", x, x-1988); else if(x

More information

bioinfo-a10s-4_align

bioinfo-a10s-4_align 4 (2) ATCAATCGATCGATC ATCCATTGAACCATC ATCAATCGATCGATC ATCAATCGAGGAGGATCGATC ATCAATCGATCGATC ATCAACGATC - CAAGACATTTTAC CATACACTTTAC CA-AGACATTTTAC CATACAC--TTTAC ** * ** ***** seq2 A A C G A seq1 C G A-CG

More information

1 1.... 3 2.... 3... 3... 3 3.... 3 4.... 4 5.... 5 1... 5 2... 5 3... 5 4... 5 6.... 6 1... 6 2... 6 3... 7 4... 7 5... 7 6... 7 7.... 8 8.... 8 9.... 9 10.... 21 11.... 21... 22 2 1. 5 2. 1995 3. 6 12

More information

Proposal Template

Proposal Template 74 2 3 33.5 33.5 13.0 13.0 16.5 16.5 11.0 11.0 10.5 10.5 10.5 10.5 0.5 0.5 3.5 3.5 1.0 1.0 35.0 (180n) 90 65.0 40.0 (20n) 10 60.0 4 5 20 20 24 24 0 25 25 29 29 20.0 20.0 30 30 34 34 20.0 20.0 35 35 39

More information

合併後の交付税について

合併後の交付税について (1) (2) 1 0.9 0.7 0.5 0.3 0.1 2 3 (1) (a), 4 (b) (a), (c) (a) 0.9 0.7 0.5 0.3 0.1 (b) (d),(e) (f) (g) (h) (a) (i) (g) (h) (j) (i) 5 (2) 6 (3) (A) (B) (A)+(B) n 1,000 1,000 2,000 n+1 970 970 1,940 3.0%

More information

1 1 2 2 2.1 Java......... 2 2.2................................. 3 2.3.................................. 3 3 4 3.1....................................

1 1 2 2 2.1 Java......... 2 2.2................................. 3 2.3.................................. 3 3 4 3.1.................................... 06H082 1 1 2 2 2.1 Java......... 2 2.2................................. 3 2.3.................................. 3 3 4 3.1..................................... 4 3.2 GP.....................................

More information

茨歯会報1401

茨歯会報1401 No.538 茨城県歯科医師会 Ibar Ib b arr ak a i D De ent e nt n al a l Ass A ss s s oc o cia ia a ti t i on o January 2014 平成26年 1 Contents No.538 http://www.ibasikai.or.jp/ 538 2014.1 538 2014.1 538 538 2014.1 538

More information

PowerPoint Presentation

PowerPoint Presentation p.130 p.198 p.208 2 double weight[num]; double min, max; min = max = weight[0]; for( i= 1; i i < NUM; i++ ) ) if if ( weight[i] > max ) max = weight[i]: if if ( weight[i] < min ) min = weight[i]: weight

More information

MFC-100 Version E ... 1 2 3 4 1 2 3 1 1 1 2 2 3 3 1 1 2 2 3 3 1 2 3 1 2 3 1 2 3 4 1 1 1 2 3 2 3 1 1 3 2 1 1 2 1 1 2 3 4 1 2 3 4 5 6 1 2 6 3 4 5 1 2 3 1 2 4 1 2 3 1 2 3 1 2 5 3 6 7

More information

パワーMOS FET π-MOS

パワーMOS FET π-MOS 7 VDSS VDSS SJ147 TO-0IS 60 1 0. SJ55 L - 30 5 0.1 P 15 SJ183 L - 60 5 0.35 SJ537 L - TO-9MOD 50 5 0.19 P 15 SJ00 180 10 0.83 SJ567 00.5.0 SJ01 00 1 0.63 SJ570 L - TO-0AB 60 30 0.038 P 15 SJ4 TO-0FL/SM

More information

はじめに

はじめに 1 Difference in differenceswooldridge(2005) - 99 - - 100 - - 101 - - 102 - - 103 - - 104 - - 105 - - 106 - 2-107 - - 108 - - 109 - - 110 - -111 - - 112 - - 113 - - 114 - - 115 - - 116 - - 117 - - 118 -

More information

6 29 6.1.............................. 29 6.2.............................. 31 6.3.... 33 7 34 7.1 Cocos2d-x..................... 35 7.2..............

6 29 6.1.............................. 29 6.2.............................. 31 6.3.... 33 7 34 7.1 Cocos2d-x..................... 35 7.2.............. 1 3 1.1.............................. 3 1.2........................ 3 2 4 2.1.................. 4 2.2.............................. 5 2.2.1.......................... 6 2.2.2.......................... 7

More information

ベンチャーと戦略ゲーム

ベンチャーと戦略ゲーム 2015 5 23 ( ) M&A IPO 2018 1. 60 (John von Neumann) (John F. Nash, Jr.) (Oskar Morgenstern) Theory of games and economic behavior 1) strategic-form game extensive-form game normal-form game non-cooperative

More information

夏リニューアル第2弾記者発表20100611

夏リニューアル第2弾記者発表20100611 2 MJ MAX GMA H.I.S. ONE PIECE in NE PIECE 2010 7 15 10 17 10 00 21 00 H.I.S. 500 400 H.I.S. ONE PIECE in POINT1 POINT2 OPEN POINT 200 100 2010 7 17 8 31 2010 6 19 8 31 400 300 7/17 8/31) 2010 7

More information

Research on decision making in multi-player games with imperfect information

Research on decision making in multi-player games with imperfect information Research on decision making in multi-player games with imperfect information 37-086521 22 2 9 UCT UCT 46 % 60000 9 % 1 1 1.1........................................ 1 1.2.....................................

More information

70 3 70 70 70 70 3 70 70 300 3 5

70 3 70 70 70 70 3 70 70 300 3 5 70 3 2611 25920 70 3 70 70 70 70 3 70 70 300 3 5 70 1 1 2 2 MAX 3 1 1 2 2 MAX 3 25 27 30 50 70 1 2 3 1 70 3 P oint 300 P oint 20 30 40 50 3 2 1 1 14 15 10 11 8 5 5 5 5 95.2 68.7 95.7 94.0 97.7 P oint

More information

... 3... 3... 3... 3... 4... 7... 10... 10... 11... 12... 12... 13... 14... 15... 18... 19... 20... 22... 22... 23 2

... 3... 3... 3... 3... 4... 7... 10... 10... 11... 12... 12... 13... 14... 15... 18... 19... 20... 22... 22... 23 2 1 ... 3... 3... 3... 3... 4... 7... 10... 10... 11... 12... 12... 13... 14... 15... 18... 19... 20... 22... 22... 23 2 3 4 5 6 7 8 9 Excel2007 10 Excel2007 11 12 13 - 14 15 16 17 18 19 20 21 22 Excel2007

More information

untitled

untitled 2008/08/05-17 18 1R 2R 3R QF SF FINAL 2008/08/05-17 18 1R 2R 3R QF SF FINAL 2008/08/05-17 18 FINAL 18 FINAL 2008/08/05-17 16 1R 2R 3R QF SF FINAL 2008/08/05-17 16 1R 2R 3R QF SF FINAL 2008/08/05-17 16

More information

全日本ジュニアテニス選手権大会2015

全日本ジュニアテニス選手権大会2015 2015/08/08-17 18 1R 2R 3R QF SF FINAL 2015/08/08-17 18 1R 2R 3R QF SF FINAL 2015/08/08-17 18 FINAL 18 FINAL 2015/08/08-17 16 1R 2R 3R QF SF FINAL 2015/08/08-17 16 1R 2R 3R QF SF FINAL 2015/08/08-17 16

More information

1 n i i 1 i n index = 0; [ index] = 1; = = ; if ( == ) { // [ index ]++; } else if () { if( index == 0 ) { // // // // [ index ]++; = ; } else { // //

1 n i i 1 i n index = 0; [ index] = 1; = = ; if ( == ) { // [ index ]++; } else if () { if( index == 0 ) { // // // // [ index ]++; = ; } else { // // 7 1 2008 12 22 1 Copyright c 2008 The Japanese Committee for International Olympiad in Informatics 1 n i i 1 i n index = 0; [ index] = 1; = = ; if ( == ) { // [ index ]++; } else if () { if( index == 0

More information

離散数理工学 第 2回 数え上げの基礎:漸化式の立て方

離散数理工学 第 2回  数え上げの基礎:漸化式の立て方 2 okamotoy@uec.ac.jp 2015 10 20 2015 10 18 15:29 ( ) (2) 2015 10 20 1 / 45 ( ) 1 (10/6) ( ) (10/13) 2 (10/20) 3 ( ) (10/27) (11/3) 4 ( ) (11/10) 5 (11/17) 6 (11/24) 7 (12/1) 8 (12/8) ( ) (2) 2015 10 20

More information

橡Taro9-生徒の活動.PDF

橡Taro9-生徒の活動.PDF 3 1 4 1 20 30 2 2 3-1- 1 2-2- -3- 18 1200 1 4-4- -5- 15 5 25 5-6- 1 4 2 1 10 20 2 3-7- 1 2 3 150 431 338-8- 2 3 100 4 5 6 7 1-9- 1291-10 - -11 - 10 1 35 2 3 1866 68 4 1871 1873 5 6-12 - 1 2 3 4 1 4-13

More information

scorecard2(page)

scorecard2(page) Corporate Environmental Report Score Card A Benchmarking Tool for Continual Improvement ABOUT THE SCORE CARD USING THE SCORE CARD HERE'S HOW YOU SCORE environmental c o r p o r a t e e v a l u a t

More information

29 4 ... 1... 1... 1... 2... 3... 4.... 4... 4... 7... 8... 8... 8... 8...12...14...14...14...16...18...18...19...21... 42...42...42....42....46....49...51....51....51... 52...52...52...53 I. I. I. I.

More information

14 12 10 8 6 4 2 0 1 2 3 4 5 6 7 8 9 10 11 12 20 0 0 0 0 0 0 0 0 0 0 0 0 21 0 0 0 0 0 0 0 0 0 0 0 0 22 0 0 0 0 0 0 0 0 0 0 0 0 23 0 0 0 0 0 0 0 0 0 0 0 0 24 0 0 0 0 0 0 0 0 0 0 0 0 25 0 0 0 0 0 0 0 0 0

More information

明解Javaによるアルゴリズムとデータ構造

明解Javaによるアルゴリズムとデータ構造 21 algorithm List 1-1 a, b, c max Scanner Column 1-1 List 1-1 // import java.util.scanner; class Max3 { public static void main(string[] args) { Scanner stdin = new Scanner(System.in); Chap01/Max3.java

More information

1 1 2 2 2.1................................................ 2 2.2......................................... 2 3 Battle Ship 3 3.1......................

1 1 2 2 2.1................................................ 2 2.2......................................... 2 3 Battle Ship 3 3.1...................... 2013 10H071 1 1 2 2 2.1................................................ 2 2.2......................................... 2 3 Battle Ship 3 3.1............................................ 3 3.2............................................

More information

http://banso.cocolog-nifty.com/ 100 100 250 5 1 1 http://www.banso.com/ 2009 5 2 10 http://www.banso.com/ 2009 5 2 http://www.banso.com/ 2009 5 2 http://www.banso.com/ < /> < /> / http://www.banso.com/

More information

2006 [3] Scratch Squeak PEN [4] PenFlowchart 2 3 PenFlowchart 4 PenFlowchart PEN xdncl PEN [5] PEN xdncl DNCL 1 1 [6] 1 PEN Fig. 1 The PEN

2006 [3] Scratch Squeak PEN [4] PenFlowchart 2 3 PenFlowchart 4 PenFlowchart PEN xdncl PEN [5] PEN xdncl DNCL 1 1 [6] 1 PEN Fig. 1 The PEN PenFlowchart 1,a) 2,b) 3,c) 2015 3 4 2015 5 12, 2015 9 5 PEN & PenFlowchart PEN Evaluation of the Effectiveness of Programming Education with Flowcharts Using PenFlowchart Wataru Nakanishi 1,a) Takeo Tatsumi

More information

離散数理工学 第 2回 数え上げの基礎:漸化式の立て方

離散数理工学 第 2回  数え上げの基礎:漸化式の立て方 2 okamotoy@uec.ac.jp 2014 10 21 2014 10 29 10:48 ( ) (2) 2014 10 21 1 / 44 ( ) 1 (10/7) ( ) (10/14) 2 (10/21) 3 ( ) (10/28) 4 ( ) (11/4) 5 (11/11) 6 (11/18) 7 (11/25) ( ) (2) 2014 10 21 2 / 44 ( ) 8 (12/2)

More information

卒業論文

卒業論文 Y = ax 1 b1 X 2 b2...x k bk e u InY = Ina + b 1 InX 1 + b 2 InX 2 +...+ b k InX k + u X 1 Y b = ab 1 X 1 1 b 1 X 2 2...X bk k e u = b 1 (ax b1 1 X b2 2...X bk k e u ) / X 1 = b 1 Y / X 1 X 1 X 1 q YX1

More information

SGML HTML XML Markup Language Web HTML HTML SGML Standard Generalized Markup Language Markup Language DTD Document Type Definition XML SGML Markup Language HTML XML HTML XML JavaScript JAVA CGI HTML Web

More information

程蘊(ていうん).indd

程蘊(ていうん).indd 1963 1964 3 1963 1 2 3 1 2 3 1963 1964 1962 LT 1963 4 5 9 30 6 7 10 8 9 10 26 10 10 27 11 12 13 14 15 1 2 34 16 1963 10 7 17 18 19 10 8 20 8 9 10 16 21 22 17 22 10 24 23 10 27 24 28 25 30 26 27 11 20 UNHCR

More information

n=360 28.6% 34.4% 36.9% n=360 2.5% 17.8% 19.2% n=64 0.8% 0.3% n=69 1.7% 3.6% 0.6% 1.4% 1.9% < > n=218 1.4% 5.6% 3.1% 60.6% 0.6% 6.9% 10.8% 6.4% 10.3% 33.1% 1.4% 3.6% 1.1% 0.0% 3.1% n=360 0% 50%

More information

Microsoft Word - Œ{Ł¶.doc

Microsoft Word - Œ{Ł¶.doc 17 59.0% 41.0% 60.8% 76.0%71.9% 65.3% 17 2.6% 3.5% 25.9% 57.3% 16.7% 28.1% 52.2% 11.1% 2.6% =270 18 2 (=199) 1 17 71.0% 76.0% 44.2% 71.9% 36.2% 18.1% 65.3% 16.7% 34.1% 16.3% 47.1% 14.9% 13.8% 5.0% 3.6%

More information

インターネットサービス_vol5

インターネットサービス_vol5 8 50G 100G 200A 100A 500A 1000A 50G 100G 200A 100A 500A 1000A 9 Web de Shop Web s s s s shttp://www.alpha-web.jp/hosting/ 10 11 Web de Shop Web 12 13 Web de Shop Web 14 2,800 5,000 shttp://www.alpha-web.jp/hosting/

More information