Abstract

The development of artificial intelligence in games has been going on for a long time. In the case of board games, artificial intelligence helps people to play against computers alone. While there have been instances where computers have beaten real people, artificial intelligence is still being refined and modified. In this work, the aim is to investigate how algorithms are used to create artificial intelligence in four different board games. For existing tic-tac-toe, gobang, go game, and chess research, different algorithms or systems are applied to different chess games. From simple to difficult, researchers have come up with more algorithms to screen out the most suitable ones to be applied. For the simpler tic-tac-toe, the researchers also adopted a simpler search tree. As the board size improves in gobang game, the researchers increase more algorithm tools in ordinary search trees to save time. In the later more complex go and chess, the researchers compared some existing techniques and analysed the advantages and disadvantages of various algorithms, and finally concluded the best application for a particular algorithm. Even though current algorithms can help AI run fast and compete with real people, it is believed that more efficient algorithms will emerge in the future to further enhance the power of AI.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.