Tic Tac Toe Game Computer Science Essay

Tic Tac Toe Game computer Science EssayMost of the research nowadays is foc employ towards problems that draw with complexity or be influenced by some kind of ergodic reddents. Interesting ab step to the fore these problems is that if they argon deterministic, thus a closure is pass judgment to exist, at least a theoretical nonpargonil. These problems atomic number 18 often enliven by patchs, much(prenominal) as mathematical grittys (ex. ticktacktoenail, Chess). On the other distri plainlye the point of randomness involved in these problems increases the difficulty of prediction on the mathematical solution, or in some situations outcome. This is thy, thither argon accredited methods of operations devised, that in diverge constitute some supplementary study to a decision advancer. In nearly of the theatrical roles, the probability statistical distribution of an even which as salutaryspring ask place randomly, it is possible to be affected by prior events.T hese endorses ar often good turned by at least 2 doers (or mevery), out of which the one is c tout ensembleed an opponent. The decisions at each step ar made by the last move of the opponent. The operations research in these gimpys is called punt theory.The critical ticktacktoo stake consists of cardinal pseudos, X and O, who take turns crisscross the spaces in a 3-3 foot goon fieldiron (C talking toley, 1993 Gardner, 1998).The plot of ground usually begins with the X pretender, and the fraud who get out manage to place trey respective arrest (in any direction, i.e. in a horizontal, vertical, or diagonal grade) wins the mettlesome. This basic strain of the bet on is earlier simple, what allows the post to be utilize as a effective tool in combinatorial pole theory, as sanitary as a branch of artificial cognition that deals with the searching of bet tree diagrams (Beck, 2008). utilize stake theory at that place are few get downes that stan d be undertakenThe naughtys solution is resulted by dominance when the mettlesome has only 1 sharp-witted system for each beterMinimax strategies go under a s confuse solution useful if the opponent makes the wrong presentMinimax strategies do non decide a stable solution using a probability distributionEven though, game theory researches are made on the possible compete strategies, they might not be employed in corporeal life when playing a game, becauseThere might be too more strategies to enumerate (this number is simply too large to be estimated). flowers are not incessantly rational.There might be much than dickens pseudos.Real-life games are not zero-sum games.This project deals with developing a noughts and crosses to be used on a ready device. The conform toing chapter discusses the Aims and Objectives of the game. Chapter 3 talks about a background research on this game, start with a review on existing noughts and crosses games, which in turn leads to discussion about the existing rides of this game and the proposed model of this work.Finally, Chapter 3 concludes with a technology research toilsome towards chocolate 2 Platform, little discrepancy (J2ME). Chapters 4 and 5 describe the system requirement analysis and excogitation on this work, and chapters 6, 7, and 8 include explanation on the implementation, testing and evaluation. And finally, chapter 9 concludes this work.2. Aim and ObjectivesThe aim of this project is to develop a Tic-Tac-Toe game for alert device. The game is supposed to consist of twain parts, one a single sham game (a pseud once morest a system), and the other a multi- shammer game (two musicians on their mobile devices, playing against each other). In coiffe to accomplish these, the following objectives were defined. oneness faker gameThe player should play Tic-Tac-Toe game on his mobile device.The player should fool picking to edit his name.The player volition start the game of choosing his symbol as X or O.If player 1 rented X then O has to be automatically allotted to the mobile device as a sec player, and vice versa.The player has an option to take away the downhearted game grid out of 4 fiddling ticktacktoe games.If player X marked horizontally or vertically or diagonally of his symbol X in a row, then player X win that small match.Finally, which player won the ut about small games ordain be declared as success of the noughts and crosses game.Multi-player gameUsing Bluetooth as communication channel the two players should play Tic-Tac-Toe game from unlike mobiles. pseudos should digest options to edit his name.Once both players connected together, then showmagazine player will start the game of choosing his symbol as X or O.If player 1 selected X then O has to be automatically allotted to player 2. because main game grid has to display in both mobiles.Player2 birth option to choose the small game grid out of 4 small noughts and crosses games. aft(prenominal) grid woof both players will play noughts and crosses game in that small grid.If player X marked horizontally or vertically or diagonally of his symbol X in a row, then player X won that small match.That small grid is marked with X and Player1 awarded 1 point, screen should zoom out and put up to display whole main game grid and now player who won the preceding(prenominal) game will hold the plectron to choose on which grid have to be select to play rest game.This play will be restate until the whole Four (4) small games grids marked with X, or O, or T.Finally which player won the maximum small games will be declared as success of the tic-tac-toe game. then game ends.3. Background ResearchIn this office the Tic-Tac-Toe game will be discussed in details. At the outset, the basic line ups of the game are going to be tiptoped. Then, there will be a review on existing Tic-Tac-Toe games, which in turn will lead to discussion about the existing models of this g ame and the proposed model of this work. Finally, this section is going to be concluded with a technology research concentrated towards coffee tree 2 Platform, Micro Edition (J2ME).3.1 Basic Rules of Tic-Tac-Toe gameThe basic Tic-Tac-Toe game consists of two players, X and O, who take turns bell ringer the spaces in a 3-3 grid (Crowley, 1993 Gardner, 1998). The game usually starts with the X player, and the player who will manage to place three respective marks wins the game. The marks empennage be placed in any direction, i.e. in a horizontal, vertical, or diagonal row. This basic meter reading of the game is instead simple and very often leads to draw. This simplicity allows the game to be used as a useful tool in combinatorial game theory, as well as a branch of artificial intelligence that deals with the searching of game trees (Beck, 2008).The Roman Empire is known to have naturalised the beginnings of the earliest known variant of tic-tac-toe. It originated around the outgrowth century BC (Crowley, 1993). At that time, the game was called Terni Lapilli. Instead of having any number of parts, each player only had three. The game was compete by moving them around to overturn spaces to keep playing. However, according to Claudia Zaslavskys book, the game Tic Tac Toe is originating from ancient Egypt (Zaslavsky, 1982).Chess and Tic-Tac-Toe are one of the most famous games to which the moves are not go forth to chances, rather than pure mathematics and system of logical reasoning. In these games, a player wins by achieving a attractive shape starting line, like for instance prevail over in chess, and 3-in-a-row in a basic Tic-Tac-Toe game in 33 get on with (Gardner, 1998). Thus, the question which shag be posed at this point is How a player can achieve a agreeable configuration first? Even though there isnt a oecumenical theorem to closure this question, there might be a well-known dodge stealing argument that can divulge a partial answ er about when a player can achieve a benignant configuration first (Beck, 2008).In nine to find a sweet strategy, in theory all the paths could be explored. However, in practice this is not easy because the total number of strategies can be calculated a double exponential function of the size of the menu. For example, a 3-dimensional 5-5-5 version of Tic-Tac-Toe, has about 3125 military strengths. This is because each one of the 53 cells has 3 optionsMarked by the first player,Marked by the second player, orUnmarked.Thus the backtracking on a graph of 3125 vertices takes at least 3125 steps. This is the main reason that this 3-dimensional 5-5-5 version of Tic-Tac-Toe remains unsolved up to date. Moreover, only two explicit fetching strategies are known from in the whole layer ofn-n- -n = nd Tic-Tac-Toe games. This is the 33 version and it is characterized with an easy winning strategy, and the 43 version that in turn has an extremely complicated winning strategy.In beau mond e to play a perfect tic-tac-toe game, i.e. a win or a draw, the player can play apt(p) they move consistent with the uppermost possible moves. This is presented in the following table (Crowley, 1993)WinIf the player has two in a row, play the thirdly to get three in a row.BlockIf the opponent has two in a row, play the third to block them.Fork perform an opportunity where you can win in two ways.Block opponents sortOption 1 Create two in a row to force the opponent into defending, as long as it doesnt result in them creating a fork or winning. For example, if X has a coign, O has the center, and X has the opposite boxwood as well, O must not play a corner in ordain to win. (Playing a corner in this scenario stools a fork for X to win.)Option 2 If there is a configuration where the opponent can fork, block that fork.CenterPlay the center. setback cornerIf the opponent is in the corner, play the opposite corner.Empty cornerPlay in a corner square.Empty sidePlay in a middle squa re on any of the 4 sides.Initially, the player that starts first gets the X and has 3 probable positions to mark in his turn. Even though it seems that there are 9 possible positions, as there are 9 squares in the grid, by rotating the board, this is not the case. It can be observed thatEvery corner mark is tactically liken to every other corner mark, andEvery edge mark is tactically equal to every other edge mark.There are thencely only three possible first marks corner, edge, or center. The first player could win (or make a draw) from any of these starting marks. It can be also observed that playing a corner would give the opponent the smallest choice of squares. This is a nice strategy as could be vie to rid of losing (Zaslavsky, 1982) .The second player can be determine as O and this player must oppose to Xs opening mark. However, this should be done in such a way as to avoid Player X to win. It can be stated that Player O must always respond with (Zaslavsky, 1982)To a cor ner opening with a center mark,To a center opening with a corner mark andTo an edge opening either with a center mark, a corner mark next to the X, or an edge mark opposite the X. any(prenominal) distinguishable play would allow X to compel a win. later on every next turn of player X, the player O should follow the above list. This way the player O can achieve a draw (or a win if the player X makes a light(a) play).3.2 Existing Tic-Tac-Toe gamesAs many other games like three mens morris, nine mens morris, pente, gomoku, Qubic, Connect Four, Quarto and Gobb allow, Tic-Tac-Toe also has the very(prenominal) goal, i.e. a player wins if he is the first one to get n-in-a-row. Basically, if a generalization is to be provided, it can be concluded that all the contrastive formations of Tic-Tac-Toe can be settleed as nd-games, which are accordingly vie on a d-dimensional boards with edge n (Zaslavsky, 1982). As it was discussed in the previous section as well, the original Tic-Tac-Toe game is really a 32-game.There are many forms, discussed as follows (Patashnik, 1980 Gardner, 1998 Beck, 2008).A slightly divers(prenominal) version of a Tic-Tac-Toe game is the 33-game, vie on a 3x3x3 board (Patashnik, 1980).It can be noted that this game gives good opportunities to the player that plays first, so he could achieve an easy win by playing at the center with his first move. Similarly, playing on a 4x4x4 board also gives the first payer better chances for wining.More complex version of a Tic-Tac-Toe game is playing it on a board with higher dimensional space. 4 dimensional, i.e. 3-3-3-3 board is one of the most commonly played Tic-Tac-Toe (Patashnik, 1980).In this version there are 2 possible aims. One of them is to position components through all of the board, thus the player that has more rows of 3 totally than the other one is the success of the game. And the other strategy is to include 4 players, in which case the winner is the payer that will get a row of 3 first. some other version is the misre tic-tac-toe game. It is played according to its conventional rules, such as in this mutation 33 game would be a draw, whereas the winner is the player that will get n in a row (Berlekamp, 1982).Quite a new game is the Tic Tac Tactic variation of tic-tac-toe (Berlekamp, 1982). This game is played on a 3 dimensional curved board, and the here each player tries to roll a ball at least half the way, as it would then drop on a grid that has 9 positions (33 grid). This way the players should make a row of 3 in order to gain a ball. The winner is the player that will have won the first 5 balls. In order to roll their balls precisely, they could use a device that helps into changing a balls trajectory.withal another version is the nine board tic-tac-toe. In this game, there are in centerfield 9 boards, arranged as 33 grids, and the first payer can start on any of them by his choice (Gardner, 1998). The following moves are supposed to be places on t he board chosen by the first player. Once this board gets full and there is no more space left hand, the next move can be again on any of the boards left, by the choice of the player. The winner is the one that will achieve 3 in a row. However, having 9 boards gives the game moreover another spirit than the usual tic-tac-toe game, as the players can have an opening, middle and end of their game.Similar to the nine board tic-tac-toe game is the super tic-tac-toe game (Beck, 2008).The difference in this variation is that this game does not end once a player makes 3 in a row in one of the 9 boards. As an alternative, the position of that board is marked on a new 33 grid, and the winner is the one that will make 3 in row there.Tic-Tac-Chess is an arouse combination of games, as it involved playing a chess game, as well as a tic-tac-toe game at the same time (Beck, 2008). In this variation, once a player captures a piece from the challenger on the chess game, makes a move on the tic- tac-toe game (even if the challenger has not placed anything on the tic-tac-toe game yet). And of course, the winner is the player that will make 3 in a row on the tic-tac-toe game first.A game that in essence is an isomorphic to a tic-tac-toe game, even though it seems as a realizedly different game, is described as follows (Beck, 2008). Basically, there are 2 players that should say a number betwixt 1 and 9, without reiterate the previously said numbers. The winner is the player that will first make a sum of 15. This game is isomorphic to a tic-tac-toe, because if those numbers are to be placed on a 33 magic grid, then it will be exactly as playing a tic-tac-toe game, because a straight line is formed only if the sum of the numbers is 15. This information is mostly useful in programming variations of a tic-tac-toe game.Another different variation again employs numbers from 1 to 9 (Gardner, 1998). These are to be placed on a 33 grid, but must be held with an order of precessio n defined by the players. Then the players play a tic-tac-toe game, filling the grid by the precedence defined beforehand.Check Lines is a very old variation of tic-tac-toe game, invented in the 1970s by Tri-ang Toys Games. In this game the board is actually any geometrical pattern that consists of 12 lines.There are 11 holes in total, distributed in a way that each line has 3 holes. At this point, each player is given 5 coins, and each player on their turn should place a coin on the board. The winner is the one that will have first completed 2 lines. Because the players have only 5 coins, this means that they have to complete intersecting lines. If no(prenominal) of the players have won after placing their 5 coins, then they will slip away playing by replacing the position of the coins, on the remaining spaces, with the rule that it must be done only on an adjacent hole. genuinely mistakable game to the tic-tac-toe game is the Toss Across game. Here, the players are given bags with beans and they are throwing them on a big board for marking the squares.Star Tic Tac Toe is another popular variation of tic-tac-toe. This game is played with checkers like movable pieces. It has a 33 board, thus a player has 3 pieces accordingly.The actors keep on replacing pieces into the spaces which are left empty in the board, until one the players wins this actually adds some more energy in the game. Moreover, the players have supplementary star shaped pieces, which can be swapped.Similar category of games as the previous bullet, are the Mojo, Mojo Too and Mojo tic-tac-toe games. In these variation the payers also pieces and pawn(s) onto empty positions until there is a winner.Moreover, there are many shows based on the tic-tac-toe game, as wellHollywood Squares is a show with 9 celebrities, which fill the cells of the tic-tac-toe grid.Tic-Tac-Dough is a show on which the players put symbols up on the board. This is achieved by tell queries in a variety of categories.I n Beat the Teacher competitors respond to questions to win a turn, again on a tic-tac-toe grid.On The Price Is Right, there is a pricing game called Secret X, in which players must estimate prices to win Xes, in order to place them on a blank board. They must position the Xes as to provide system of the location on the secret X. This is in turn hidden in the middle line of the board, forming a tic-tac-toe line across.The fictional game Dni game of Gemedet, has an aim to place 6 balls in a row to a 9x9x9 grid (Gardner, 1998).The fictional game Squid-Tac-Toad, has an aim to place 4 or 5 balls in a row to a 44 or 55 grid, accordingly (Gardner, 1998).A more simplistic variation of this game is having the rules as of the Y formations to count as a win. This is rather simple, because all the scenarios basically forming some kind of a Y configuration.Quantum tic tac toe is yet another variation in which the participants are positioning a quantum superposition of numbers on a tic tac toe b oard (Gardner, 1998).A larger grid (for example 1010) tic-tac-toe games also exist. In a 1010 grid the winner should place 5 in a row. The more the grids there are on a board, the larger complexity of the game is.Another similar game named Go-moku, originating from Vietnam, also has the strategy for a player to get 5 in a row in order to win the game (Gardner, 1998). The players put Xs and Os, but in order to pronounce blocking each other, in this variation they should also try to create changes for wining. Another difference is that the board has no limit, thus the game is played until there is a winner.Three Mens Morris and Nine Mens Morris are also variations, in which there is a limiting on the number of pieces in order for a move to be allowed (Gardner, 1998).Finally, the last variation of the tic-tac-toe game, employs the words eat, an, laf, it, line, if, lot, on and foe. In this game, the winner is the one that will select 3 words that start with the same letter. If the game was places on a tic-tac-toe grid, it would mean 3 words in order to form a line (three in a row line).3.3 Proposed modelThere are instead a few algorithmic programs hat can be used for creating the Tic-Tac-Toes game strategy. The most popular ones are the semantic algorithms and the lexical algorithms. For this project, a lexical algorithm was utilized. The model of the tic-tac-toe game described in this work contains 2 different game strategies. Basically, the one strategy is the Single Player game where a player plays against a system. The other strategy involves Multiple Player environment, and it is being played by a player versus another player.In order to analyze this game, a decision tree might be used. Moreover, for the analyzing part it should be assumed that both the players in the Multiple Player environment, and the single player in the Single Player game, are in essence experienced. This means that the result of a game can be foreseen after the first move from each p articipant (again assuming that there are no mistakes). Let us spiel with 1 if the player that has the X wins and with -1 if the player that has the O wins. The following construe represents the decision tree after the first move from each participant. As it was already discussed in section 3.1 Basic Rules of Tic-Tac-Toe game, the tic-tac-toe game is symmetric and therefore it is sufficient to consider only the squares 1, 2 and 3 for the first player (see the mannikin below). The rest of the moves are symmetric and will be presented. So, following this reasoning, the first player has the positions 1, 2 and 3 available, and the second player has the remaining two positions.The figure above presents an expansion, so called an big form. It demonstrates that even in the simplest scenario the decision tree can be quite large. For example, if the first two moves were to be presented, this would be impossible to be demo on a single page.Similarly to this discussion, the strategic form of the game can be presented by a different model, i.e. as a ground substance. In order to demonstrate this approach, it should be assumed that the players choose one strategy and they strictly follow it when their turn comes. Of course, each strategy should represent all the paths of action and in every possible situation.At the beginning, let us assume that there is a strategy that the first player uses for their first move, and another strategy for the first move of the second player. This logic would create some rules like the following (Zaslavsky, 1982)For the first player select one of the nine squares on the game board.For the second player tell apart one of the nine squares on the game board. If the first player already uses the selected square, then put an O in square 3, 5, 7, or 9 if an X is in square 1 (center) put an O in cell 1 if an X is in cell j.These rules are examples of complete strategies, and these can be selected by the payers before the beginning of the gam e, and thus followed with their first moves. The strategic form of a tic-tac-toe game is presented on the figure below. It should be noted that the entries in the table below are in essence the values of the game. They hold values for every possible selection of strategies.Each tic-tac-toe game that can be actually presented in an extensive form would have an equivalent strategic form similar to the one shown in the table presented above. Moreover, this table is also equivalent to the matrix established previously. The payoff matrix in cooperation with the descriptions of the strategies comprises the model for the two-person tic-tac-toe game.3.4 parity of Proposed model with Existing ModelsThe semantic algorithm is yet another approach towards the tic-tac-toe game. The semantic algorithm is in essence a acquisition algorithm, and it might be social organizationd in the following way. It might have as initial information the ability to recognizing the 3 states of a game lost, won or a draw. The algorithm in this case would play the X, and it will play against another algorithm, i.e. the O. As soon as a game is finishes, the information if the game was won or lost is stored. Moreover, the moves are presented with the smaller letters x and o accordingly. A possible structure of stored information could be the following line x5 o3 x9 o4 x1 won. The first move is always randomly selected. So, given that the algorithm played 7 (x7), and the opponent played 6 (o6), the algorithm will search for previous games that are most similar to x7 o6. If such a case is found, then the following rules applyIf the game found was a win, than the algorithm will try to spew the move. If the position is not available, it will play randomly.If the game found was a loss, the algorithm will try to correct the move, by not placing an element in the same position as in the lost game.This is repeated until there is a winner. Moreover, if a game end with a draw, it is not saved in the d atabase.Comparing this algorithm with a lexical algorithm such as our proposed model, it might be noted that the semantic algorithm usually plays very badly at the begging. But, after a received number of games, the learning curve of the algorithm becomes better. On the other hand, our proposed model behaves well during all the stages of the game.3.5 Technology Research (j2me)Being quite different from other programming languages, burnt umber does both compiling and interpreting when it comes to process commandment.As it can be seen from the photo above, the source code (i.e. the . java files) is initially translated by the compiler. This gives an output of an intermediate language, called coffee bytecode (i.e. the .class files). The bytecode is then ready to be executed (or in other words, interpreted) within a particular virtual(prenominal) processor, known as the JVM ( burnt umber virtual(prenominal) Machine) (Hayun, 2009 Knudsen, 2008). This is in essence a simulate processo r that executes all the bytecode commands. The Java Virtual Machine is the basic components that give to Java the feature to compatibility. This is simply because it represents a reliable layer between bytecode and the concrete auto instructions, translated at runtime.Over the years, the Java language has undergone many changes and development. J2SE (Java 2 Standard Edition) had its first edition targeting GUIs, applets, and other basic and rather simple applications. Recently, the language was extended with the Java suite known as J2EE (Java 2 Enterprise Edition). This edition is based for emcee side development, and includes tools for database access, messaging, subject area rendering, inter-process communications, and transaction control (Hayun, 2009 Li, 2005). J2ME (Java 2 Micro Edition) came into existence as to cover the needs for applications targeting mobile devices. As it can be seen from this short overview, there are versions of Java to suit different environments from the enterprise development tools think for use in servers, to the micro systems. An important thing to note at this point is that the separation between platforms is not just unconditional (Knudsen, 2008). umteen times these are not a simple line than can be drawn. In order to demonstrate this, it might be explained that Java 2 Micro Edition development sometimes requires the use of Java 2 Enterprise Edition and Java 2 Micro Edition. This is the case with multiplayer games for instance, so and Java 2 Micro Edition is used for the customer side, but Java 2 Enterprise Edition is used for the server side of the application/game. Moreover, different Java editions target different ironware configurations. Similarly, there are 3 virtual machines to be used for the different environments (Li, 2005). For example, Hotspot VM is a default virtual machine suitable for a executing the full-scale edition of JavaHotspot. JavaHotspot is a newer type of virtual machine competent of vigorously o ptimizing a great deal of executed code (called as hotspots) during the runtime (Li, 2005). Other versions of virtual machine are the Compact Virtual Machine (CVM) and Kilobyte Virtual Machine (KVM). These are in essence smaller virtual machine implementations. They are targeted to run within the restrictions of the moderate resources found on the micro devices (these will be discussed later in this section, as well).The requirement of having another version (like the Java 2 Micro Edition) for the mobile devices came because these devices do not have sufficient recourses to run Java 2 Standard Edition, since J2SE was clearly way excessively large to see to it on even the larger micro devices. However, the question was imposed initially was which features should be left out from the J2SE, so to be minimized in a smaller edition. Also, having great diversity of different devices, it would not have been a nice decision to restrict all the J2ME applications to the lowest harmonious hardware configuration (Li, 2005 Kochnev, 2003). Moreover, this solution would not have been practical as well, because it would incorrectly neglect the capabilities of the higher end devices. The final solution is savvy through a mixture of J2ME configurations and profiles (Krikke, 2005). It represented a revised Java architecture, which actually offers for the leaving out of parts of the platform, at the same time as addition to device and category precise components. Along these lines, the configuration would identify the abilities of a Java platform intended for use on a sequence of analogous hardware. Possible components that can be withdraw are the following (Kochnev, 2003 Lefevre, 2005)Java language mechanismsmallest amount hardware necessities, such as the memory, screen size, and processor power for the family of devicesintegrated Java librariesBy utilizing this approach, there are actually 2 preset configurations for mobile devices one for somewhat restricted devices su ch as PDAs and Set-Top-Boxes (for instance the digital TV receivers), and another one for devices such as pagers and mobile phones.These two configurations are (Kochnev, 2003 Krikke, 2005 Lefevre, 2005)CDC (Connected Device Configuration)CLDC (Connected, Limited Device Configuration)All of these configurations are to be reviewed as follows. On the other hand, a good example of java profiles is the UI (User Interface) for mobile phones. For example, the J2ME configuration CLDC that wraps this type of device, keeps out the typical Java UI libraries (AWT and Swing). The devices do not have the ability of presenting anything derived from these libraries in any case. This is due to the situation that their screens are just too small. Thus, there is no point to slaughtering set space on them. The solution was to generate an innovative User Interface, suitable to the exact necessities of the poor mobiles LCD display. The consequential LCD UI is built-in in the CLDC profile. This targets MIDs (Mobile Information Devices), for this reason the name is MIDP.The CDC is built for bigger devices such as digital TV set-top-boxes and PDAs. These are devices characteristically with numerous space of memory. The CDC is the bigger brother of the J2ME configurations. It encloses a single profile (the Foundation profile) as well as a high performance virtual machine (known as the Compact Virtual Machine CVM). This Java language implementation, as well as the API, practically has all the influence of J2SE.Unluckily, the CDC is not accessible on the platform for the most micro-game players (the mobile phones).The CLDC is especially targeted to micro devices, like mobile phones. It fundamentally defines a standard, which in turn is used by all the device manufact