Chinese Checkers Project 3
Uploaded by
ScribdTranslationsChinese Checkers Project 3
Uploaded by
ScribdTranslationsCOMPUTER PROGRAMMING PROJECT
John Alexander Herrera Perez
Grancolombiano Polytechnic “Eng. “Telecommunications”
[email protected]
Abstract-This work shows the work developed throughout the Create a winning-oriented Chinese checkers autoplayer.
semester in the course how to implement functions to the code and
how to understand and analyze the lines of code of a program and
thus be able to identify the flaws of the same Justification.
Keywords- Functions, matrices, programming language, game, To solve the problem, which is to implement an
Chinese checkers, Java,
automatic player, an algorithm will be created in which
I. INTRODUCTION the strategy that must be used by the player to fulfill his
goal, which is to win, must be specified.
Virtual worlds should make it easy for the researcher to
create environments for research and obtain results, and III CONCLUSIONS
they should also maintain the player's interest in order to
have large numbers of experimental subjects. In this In this project we can conclude that it is not necessary to
document you will find the solution to the problem of program to understand and analyze a problem in which it
implementing an automatic player oriented to win in the can be understood from a series of steps which is defined
game of Chinese damages. An algorithm will be created as an algorithm, in the game new functions and
for its respective programming in the game already arrangements will be added according to contexts
created, feeding it with new functions and fixes in the explained in class.
code for its proper functioning. IV Strategy
II CONTENT DEVELOPMENT which will be implemented in the player oriented to win
PROJECT OBJECTIVES: 1. The board is put in order
2. The chips are placed on the black squares.
GENERAL OBJECTIVE:
3. He is about to start playing
-Create, structure and feed the code of a game called 4. The first to play is the one with the black pieces
Chinese checkers which must implement an automatic 5. The first thing is to move the black pieces in
player oriented to win. such a way that a diagonal line is made, blocking
the opponent from advancing on our board.
SPECIFIC OBJECTIVE:
The fundamental objective of the algorithm is to
design solution strategies, which are arranged in a
sequential and logical manner.
Raise, examine and solve different situations where
the use of algorithms is completely necessary in
association with the implementation of mathematical
and physical models
Identify and manipulate different types of data
(numeric, character, boolean, etc.)
Understand the utilities offered by subroutines in the 6. The next step is to eliminate white pieces as you
design of an application (Subroutines and Functions) advance.
Using structured data to solve problems in complex
situations (Arrays and matrices)
Use knowledge acquired in class for the
implementation of the player
Problem statement
7. We have to sacrifice the third row first so that
the opponent can advance and eliminate his row.
11. With that queen we will play with the opponent
so that he aligns the pieces in such a way that
with the queen we can remove all the white
farms and be able to win.
8. Try not to move your first row of the board so
much that your opponent cannot easily make
checkers.
The idea and strategy is to block the opponent and be
able to get the first queen and not move our first row
so that the opponent cannot get queens. Playing on
the offensive is about capturing our opponent's
pieces instead of trying too hard to defend our own.
It's okay if they capture some of our checkers as long
as we take away more of our opponent's checkers.
9. We have to make the opponent move the pieces V Code for the delivery of the second cut in which the
on the first row so we can advance and get our most advanced piece and the free neighboring position
first queen. had to be identified
10. With that queen we will proceed to eliminate the
most vulnerable pieces, which are those in the
second row.
VI References
[ Stive ray, «line of code,» java, 09 007 2010. [Online].
1 Available: http://lineadecodigo.com/java/crear-una-
] matriz-en-java/. [Last accessed: 26 05 2019].
[ Manuel Sierra, «learn to program.com,» Apr, 05 08
2 2006. [Online]. Available:
] https://www.aprenderaprogramar.com/index.php?
option=com_content&view=article&id=168:repaso-
arrays-o-arreglos-unidimensionales-en-java-tipos-de-
inicializacion-ejemplos-de-codigo-
cu00903c&catid=58&Itemid=180. [Last accessed: 26
05 2019].
[ anonymous, "wikilibros," wiki, July 28, 2016.
3 [Online]. Available:
] https://es.wikibooks.org/wiki/Programaci
%C3%B3n_en_Java/Funciones. [Last accessed: 5
May 2019].
[ AND. Cape, “My Java World,” Java, January 12,
4 2011. [Online]. Available:
] http://www.mundojava.net/instrucciones-
conditionales.html?Pg=java_inicial_4_4_8_2.html.
[Last accessed: 26 May 2019].
[ m. rojas, «okdiario,» howto, March 21, 2018.
5 [Online]. Available:
] https://okdiario.com/howto/como-jugar-damas-chinas-
1991869. [Last accessed: 26 May 2019].
[ j. armando, «doncomos,» Leisure, 01 09 2018.
6 [Online]. Available:
] https://ocio.doncomos.com/damas-chinas-jugar-
damas-chinas. [Last accessed: 26 05 2019].
