The University of MelbourneSchool of Computing and Information SystemsCOMP30024 Artificial IntelligenceRules for the Game ofChexersLast updated March 11, 2019Chexers is a three-player hexagonal turn-based race game. Test the loyalty of your band of twofacedcheckerpieces as you charge them through a twisting and treacherous battleground. Will all yourpieces stay true to your cause? Can you earn yourself some new followers in the chaos? To win thistumultuous chase, you must double-cross and triple-cross your way across the finish line before youropponents—three, two, one... go!SetupChexers plays on a hexagonal board of 37 hexes, as illustrated in Figure 1. Three players (Red, Green, andBlue) play the game. Each player initially controls 4 pieces of their colour. The pieces begin in the configurationshown below in Figure 1, occupying hexes along three edges of the board.Figure 1: Board with 37 hexes and starting configuration of 12 pieces: 4 Red (R), 4 Green (G), 4 Blue (B).1GameplayPlayers take turns, starting with Red, followed by Green, followed by Blue. This cycle repeats until the gameends. On each turn, the current player must take a single action involving a piece in their colour, if possible. Thisaction may be a move action, a jump action, or an exit action. If no such actions are possible the player mustpass instead, taking no action. Note that a player can only pass if they have no available actions (for example ifthe player has no remaining pieces or their remaining pieces are ‘blocked’ by other pieces). Each type of action isdescribed in the following sections.Move actionsA move action (a ‘move’) involves moving a piece from the hex it currently occupies to an adjacent hex (one ofthe at-most-six hexes in direct contact with the current hex on the board). For the move action to take place, theadjacent hex must not be occupied by another piece. A configuration illustrating available move actions is shownin Figure 2a.Jump actionsA jump action (a ‘jump’) involves moving a piece from its current hex to an unoccupied hex opposite someoccupied adjacent hex. That is, a piece ‘jumps over’ an adjacent piece onto the hex directly on the other side fromwhere it started. Figure 2b explores an example configuration to illustrate these concepts.The adjacent piece (the one to be ‘jumped over’) may have any colour. If this piece is a different colour fromthe jumping piece, then it will be converted—its colour will change to the colour of the jumping piece as a resultof the jump action. In this way, jump actions enable a player to ‘gain control’ of additional pieces.(a) Move actions: In this configuration,the piece R1 has an available move actionto each of the hexes marked a, b, c and d.Though the hexes occupied by G and R2 arealso adjacent, moves to these hexes are notavailable since they are occupied. G is on ahex near an edge of the board and has only4 adjacent hexes to begin with; since 2 ofthem are occupied (by B and R1), G canonly move to hex a or hex d.(b) Jump actions: In this configuration, G1 has a jump action availableover G2 to the horizontally opposite hex marked b. G1 cannot jump overR because the hex opposite R is occupied (by B). Note that G1 cannotjump all the way to the hex marked d either: a jumping piece may only goover a single hex. G2 can jump over R because the opposite hex from G2’sperspective, e, is unoccupied (this jump action will result in the conversionof R to a Green piece). G2 cannot jump over G1 because there is no hexopposite G1 from G2’s perspective (such a hex would have to be at theposition marked x). Note further that ‘jump sequences’ are not allowed:G2 cannot jump over R to e and then over B to c in one action, for example.Figure 2: These partial board configurations exemplify the rules for move actions and jump actions.Exit actionsAn exit action (an ‘exit’) involves a piece ‘leaving the board’. These actions are only possible when a piece occupiessome hex on the edge of the board directly opposite the edge where the controlling player’s pieces started the game(as per Figure 1). The exiting piece is removed from the board (leaving its hex unoccupied). Figure 3 outlines thehexes that allow exit actions for each player, and shows some examples of available exit actions.(a) This figure marks the hexes where Red’spieces have available exit actions with r,Green’s with g and Blue’s with b. Eachmarked hex is on the opposite edge of theboard from its player’s starting position(compare with Figure 1 which shows thesestarting positions).(b) In this configuration, only R1 and G2 have available exit actions: theyoccupy hexes marked for their colour in Figure 3a. B1, B2 and R2 alsooccupy hexes on edges of the board, but they are not on the correct edgesto exit for their respective colours. Note that it is not possible to ‘jump offthe board’: For example, even though G1 has an adjacent piece between itand the edge of the board opposite Green’s starting position, G1 does notoccupy a hex marked g in Figure 3a, so it has no available exiting action.Figure 3: These diagrams demonstrate the rules for exiting actions.Ending the gameThe game ends as soon as any player has taken 4 exiting actions (as described above). That player wins the game,and the other two players lose the game. Note that it is not enough simply to have 4 pieces ‘in position’ for exitactions: a turn must be taken to carry out each of the 4 exit actions to win.Alternatively, the game may end in a draw with no players winning the game. A draw is declared if either ofthe following conditions are met: One board configuration (with the same pieces occupying the same hexes on the same player’s turn, ignoringrearrangements of same-coloured pieces) occurs for a fourth time since the start of the game. These repeatedboard configurations do not need to occur in succession. Each player has had their 256th turn (including turns where the player must pass) and no winner has beendeclared.3本团队核心人员组成主要包括BAT一线工程师，精通德英语！我们主要业务范围是代做编程大作业、课程设计等等。我们的方向领域：window编程 数值算法 AI人工智能 金融统计 计量分析 大数据 网络编程 WEB编程 通讯编程 游戏编程多媒体linux 外挂编程 程序API图像处理 嵌入式/单片机 数据库编程 控制台 进程与线程 网络安全 汇编语言 硬件编程 软件设计 工程标准规等。其中代写编程、代写程序、代写留学生程序作业语言或工具包括但不限于以下范围:C/C++/C#代写Java代写IT代写Python代写辅导编程作业Matlab代写Haskell代写Processing代写Linux环境搭建Rust代写Data Structure Assginment 数据结构代写MIPS代写Machine Learning 作业 代写Oracle/SQL/PostgreSQL/Pig 数据库代写/代做/辅导Web开发、网站开发、网站作业ASP.NET网站开发Finance Insurace Statistics统计、回归、迭代Prolog代写Computer Computational method代做因为专业，所以值得信赖。如有需要，请加QQ：99515681 或邮箱：[email protected] 微信：codehelp QQ：99515681 或邮箱：[email protected] 微信：codehelp
