IJDCST @ May-June-2018, Issue- V-6, I-6, SW-02

ISSN-2320-7884 (Online)
ISSN-2321-0257 (Print)

Solving the Complexity of Geometry Friends by using AI

and Deep Learning
Karthik Kumar Kirakala,
Sri SatyaSai University of Technology & Medical Sciences, Sehore (MP)

Abstract: Artificial Intelligence is the most widely CHALLENGES FOR THE AI

used in many applications. Especially, applications A few highlights of Geometry Friends make it an
such as pattern recognition, gender classification especially interesting AI test bed, the most essential
and other types of applications. Geometry friends being the satisfying fundamental thinking between
are characters used in the puzzle games and these the two individual players. For human players
are in various shapes such as circle or rectangle. participation turns into all-great easily as a kind of
Designing the agent based games with geometry cooperation and correspondence as technique for
friends and AI adopted techniques gives the better accomplishing a typical target. Consistently, to win
result. Many existing systems have the agent miss- in Geometry Friends players need to:
understanding problem which may cause confusion
between the geometry friends. In this paper, an • Determine which collectibles (important
amalgamative artificial intelligence and adopted stones) each character can get with no other
with convolution neural networks technique person's data and which require joint development
developed a puzzle game to increase the tedious to of the two players;
the player.
• Determine the interest by which the
Keywords: ML, geometry friends, artificial collectibles must be acquired, in light of the
intelligence, generalization. manner in which that specific activities may incite
unrecoverable conditions (for example in the event
INTRODUCTION
that the Rectangle falls it can't ricochet back);
Recently, another stage AI competition has been
presented utilizing "Geometry Friends”. The player
• Divide the assignment of gathering the
can control rectangle and circle objects to collect
diamonds by the two players, as indicated by the
diamonds on the level. The objective is to collect
obstacles picked in the two past center interests;
the majority of the diamonds for a short range. The
rectangle and circle objects have diverse limit. For
• For every collectible, pick the strategy of
instance, rectangle objects can slide sideway and
controls integral for the relating characters to stay
resize (no mass change). Regardless, circle objects
it, including shaped activities;
can roll sideway and resize (mass change). To
manage complex issues, the two indisputable
• Execute the controls in the distraction
objects need to cooperate. It has a physics engine to
condition, pondering the imitated physics;
simulate friction, acceleration and gravity.
Geometry Friends has besides physics based
• Do all these always and as quick as would
redirection condition, with highlights, for example,
be sensible.
growing rate and squashing. This dynamic
condition requires a specific extent of capacity and
For the greater part of the above clearly, to perform
coordination from the two players so as to
well, players need to achieve some attention and
effectively signify estimation. This makes an
basic commitment with respect to parts of the task.
unconventional test to the players, making it an
entrancing pertinent examination for Artificial
An AI player should manage all the six, which
Intelligence (AI).
present inconveniences in three phenomenal
estimations:

1 www.ijdcst.com
IJDCST @ May-June-2018, Issue- V-6, I-6, SW-02
ISSN-2320-7884 (Online)
ISSN-2321-0257 (Print)
• Dealing with coordination at various
estimations: from advancement control to shared
planning;
• Dealing with fine-grained material science
based actuation;
• Dealing with inquiry understanding.
Since the two characters have specific actuation
limits, they move in the game world in various
courses and, in light of the likelihood of the
estimations, they reliably need to join endeavors to
abuse each other's attributes. This cooperation is
required at arranging level, for distributing
assignment to manufacture execution, and at
actuation level, to urge joint activities to achieve
certain parts of the game world.
Furthermore, despite the manner in which that
Geometry Friends is seen and played like most
other two dimensional platform games, for
example, Super Mario Bros., the control of the
headway is dynamic and testing, in perspective of
the physics engine. Specifically, there are different
conditions that require right foreseeing
synchronous made activities.
At last, Geometry Friends, as an inquiry
preoccupation, highlights particular estimations
where players must use some major thinking, in
light of the path that there are requirements in the
interest by which collectibles must be picked. This
recommends completing a wrong, irreversible
activity (e.g tumbling from a stage too early) can
predict completing an estimation with headway
(see Figure 2 for a model).
Artificial Intelligence in Geometry Friends
Carlos Fraga was the primary individual making
artificial intelligent agents for Geometry Friends
[1]. His answer used a navigational graph and its
progression was before the essential variant of the
competition and was totally occupied with the
supportive state of Geometry Friends.
The graph has distinctive kinds of edges relying
upon whether the edge is traversable by the circle
alone, by the rectangle alone, or by the two
characters. The nodes of the graph are arranged on
both agents' starting positions and on the diamonds'
positions. These fundamental nodes are expanded,
2 www.ijdcst.com
making distinctive nodes all through the
measurement. Exactly when the agent will play out
a movement, it chooses its way through the A*
algorithm. Consequent to picking which approach
to take, that way is confined into a great deal of
exercises, which are a movement of improvements
that will empower the expert to accomplish express
nodes of the graph that are en route. In the wake of
completing every movement, the authority keeps an
eye in the unlikely event that it accomplished the
organized action result. In case it had done all
things considered, the agent on and on proceeds to
next action on the endeavor until the moment that
that task is fulfilled. At whatever point a movement
is unsuccessful or the task is done, the agent
calculates the accompanying task performed. The
basic downside of this system is the getting ready
overhead caused by running the A* algorithm each
time the agent needs to calculate a task. Another
issue is that each agent is simply prepared to work
together with another expert having a comparative
algorithm, which powers an imperative limitation
when playing with an optional partner.
CIBot (Sejong University): These gathering
organized agents that, in a fundamental stage,
proritized the individual collection of diamonds,
tolerating indistinct exercises from if these were
performing in single-player tracks. After this
movement, the two agents start playing
supportively, where the circle plays the guideline
work in the get-together endeavor and the rectangle
carries on as a moving stage to the drift, in order to
accomplish distinctive stages or diamonds that
were hard to reach through individual play.
Thusly, the rectangle agent seeks after the circle
agents advancement, while endeavoring to be
underneath it, and stretches vertically when the two
agents are under a diamond, lessening its partition
to it. It is the circle agent that picks the target
diamond and, after it is assembled, the agent picks
the accompanying closest diamond to its position,
reiterating the strategy until the moment that the
measurement is done.
The Circle track received two submissions:
CIBot (Sejong University):By creating a directed
graph in the start of the every estimation, this agent
utilizes the Dijkstra's calculation to accomplish the
IJDCST @ May-June-2018, Issue- V-6, I-6, SW-02
ISSN-2320-7884 (Online)
ISSN-2321-0257 (Print)
most compelled course through the resulting graph.
Each stage's edge is a node and links between
nodes are made at whatever point the circle agent
can cross beginning with one edge then onto the
following one. The estimation most lessened stage,
the floor, is solidified into the chart and edges
having a place with a similar stage are constantly
related. The Dijkstra's check makes an outline of
diamonds requested by their separation to the key
position to the circle agent. It picks the first and
moves towards it and when the diamond is
gathered, the overseer moves to the going with one,
repeating this procedure until the point that the
important stone once-over is vacant, finishing the
estimation. The circle moving strategy is
masterminded in an immediate standard based-
structure that utilizes voracious rolls and bounces
to affect the agent to draw nearer to the objective
diamond.
Figure 1: CIBot Circle Agent’s Graph. The nodes
of the graph are the edge points.
KUAS-IS Lab (National Kaohsiung University
of Applied Sciences): The circle agent utilizes A*
ask for and Q-production feeling of how to finish
every estimation. The fundamental check enables
the agent to locate the most brief way to deal with
amass the majority of the diamonds utilizing a
graph that tends to the estimation, in like manner to
the CIBot manager, with the capability that this
graph takes data of the diamond's positions and the
demand heuristic uses the segment to the diamonds.
The Q-learning estimation is utilized to set up the
agent to address its pathing by utilizing the Q-table
attributes search for heuristic, enabling the head to
make stay away from gridlocks and unreachable
diamonds, which would make the estimation
complete immense.
PROPOSED METHOD
3 www.ijdcst.com
Designing the game with various amalgamative
algorithms merged and developed an intelligent
game program which is used to provide the
complex features for the players. In this paper, the
amalgamative algorithm provides the integrated
features of artificial intelligence and deep learning
algorithms.
AI in Game Design: AI in the game is very
important task to help the agents and to improve
the performance of the system players to handle the
critical situation.
Role of Geometry Friends: GF is one of the
platforms to design the puzzle game.
Various reinforcement learning algorithms need a
lot of data until they reach accurate performance.
The Deep Q-learning from Demonstrations (DQfD)
solution [3] proposes using a low quantity of
demonstration data in order to utilize the learning
process. The proposed method combines both
supervised learning and reinforcement learning for
the agent to be able to learn how to imitate the
demonstrator and have self-awareness.
The proposed system initialize the threshold value
for the level based increase of complexity of the
game and also improve the agents performance.
Levels Existing Proposed Complexity(PS)
(Collected (Collected
cubes) cubes)
1 4 6 10%
2 3 7 70%
3 2 8 90%
Table: 1 Level based performance in PS.
In this game, there are three levels. For every level
if the performance is high the complexity becomes
high.
CONCLUSION
Geometry Friends platform game requires multi
target improvement (Time and Diamond
Collection) to finish each level. In this paper, the
proposed system works not only to improve the
performance of the players but also to create the
complexity in playing game.
REFERENCES
[1] C. de Sousa Fraga, “Motion Control for an
Artificial Character teaming with a Human Player
in a Casual Game”, PhD thesis, INSTITUTO
SUPERIOR TE´CNICO, 2011.
IJDCST @ May-June-2018, Issue- V-6, I-6, SW-02
ISSN-2320-7884 (Online)
ISSN-2321-0257 (Print)

[2] C. B. Browne, et al., “A Survey of Monte Carlo

Tree Search Methods,” IEEE Trans. Comput. Intell.
AI Games, vol. 4, no. 1, pp. 1–43, 2014.
[3] G. Seetharaman, et al., “Unmanned vehicles
come of age: The darpa grand challenge,”
Computer, vol. 39, no. 12, pp. 26–29, 2006.
[4] D. Billings, et al., “Poker as a test bed for AI
Research,” Advances in Artificial Intelligence, pp.
228–238, 1998.
[5] M. Genesereth, et al., “General game playing:
Overview of the AAAI competition,” AI Magazine,
vol. 26, no. 2, pp. 62–72, 2005.
[6] J. Togelius, et al., “The 2009 Mario AI
competition,” in Proceedings of the IEEE Congress
on Evolutionary Computation, 2010.
[7] P. Hingston, “A Turing test for computer game
bots,” Computational Intelligence and AI in
Games, IEEE Transactions on, vol. 1, no. 3, pp.
169–186, 2009.
[8] S. M. Lucas and T. P. Runarsson, “Temporal
difference learning versus co-evolution for
acquiring Othello position evaluation” in
Computational Intelligence and Games, 2006 IEEE
Symposium, pp. 52–59.
[9] M. Buro, “Orts: A hack-free rts game
environment,” in Computers and Games. Springer,
2003, pp. 280–291.
[10] S. Ontanon, et al., “A survey of real-time
strategy game AI Research and competition in star
craft,” IEEE Transactions on Computational
Intelligence and AI In Games, 2013.
[11] D. Loiacono, et al., “The 2009 simulated car
racing championship,” Computational Intelligence
and AI in Games, IEEE Transactions on, vol. 2, no.
2, pp. 131–147, 2010.
[12] S. Mohan and J. E. Laird. Relational
reinforcement learning in infinite mario. arXiv
preprintarXiv:1202.6386, 2012.
[13] R. Prada, et al., “The Geometry Friends game
AI competition”, (CIG), 2015 IEEE Conference on,
pages 431–438. IEEE, 2015.
[14] J. B. Rocha, et al., “Game mechanics for
cooperative games.ZON Digital Games”, 2008,
pages 72–80, 2008.

4 www.ijdcst.com