Toba, Hapnes and Kurniawan, Billy (2008) Aplikasi Permainan Capsah Banting dengan Penerapan Algoritma Minimax. Jurnal Informatika, 4 (1). pp. 12-27.
![[img]](http://repository.maranatha.edu/style/images/fileicons/text.png) |
Text
Aplikasi Permainan Capsah Banting.pdf - Published Version Download (484Kb) |
Abstract
Big-two card game, is one of well-known card climbing games which probably originated in coastal China around 1980. Soon it became very popular in Shanghai, Hong Kong, Taiwan and also in the Philippines and Singapore; it has also spread to some western countries. In climbing games, each player in turn must play a higher card (or combination of cards) than the previous player. A player who cannot or does not wish to beat the previous play can pass. This continues for as many rounds as necessary until someone makes a play which no one will beat. That player wins the "trick" and leads to another one. Because players can pass, their cards are not used at an equal rate and some will run out before others. This kind of strategy produces an imperfect information environment. In this article will be reported how the Big Two card game is implemented in computer with the application of Minimax Algorithm, to predict the information, i.e. the value of cards in hand, for the next player who has the turn to minimize the card “value” of the other players.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Big Two, Card Games, MíniMax Algortihm, Macromedia Flash |
| Subjects: | T Technology > T Technology (General) |
| Depositing User: | Perpustakaan Maranatha |
| Date Deposited: | 14 Feb 2012 09:25 |
| Last Modified: | 14 Feb 2012 09:25 |
| URI: | http://repository.maranatha.edu/id/eprint/330 |
Actions (login required)
 |
View Item |
