Application of A-Star Algorithm on Pathfinding Game

Pathfinding is the method for determining the shortest path. Pathfinding is widely used in various fields of Computer Science. One of them is game development. This research will design and analyze the pathfinding using the A-Star algorithm and implement it on a tree planting game. The Artificial In...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1898; no. 1; pp. 12047 - 12052
Main Authors Candra, Ade, Budiman, Mohammad Andri, Pohan, Rahmat Irfan
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.06.2021
Subjects
Algorithms
Artificial intelligence
Games
Nodes
Physics
Shortest-path problems
Tree planting
Online AccessGet full text
ISSN1742-6588
1742-6596
1742-6596
DOI10.1088/1742-6596/1898/1/012047

Cover

Abstract Pathfinding is the method for determining the shortest path. Pathfinding is widely used in various fields of Computer Science. One of them is game development. This research will design and analyze the pathfinding using the A-Star algorithm and implement it on a tree planting game. The Artificial Intelligence in the game will find its own shortest path from the start node to the goal node. The heuristic of A-Star is the Manhattan Distance that allows movement in four different directions. The result shows that the number of visited nodes will increase if the grid has many obstacle nodes, and the average time of the A-Star pathfinding process is 0.0732 seconds.
AbstractList Pathfinding is the method for determining the shortest path. Pathfinding is widely used in various fields of Computer Science. One of them is game development. This research will design and analyze the pathfinding using the A-Star algorithm and implement it on a tree planting game. The Artificial Intelligence in the game will find its own shortest path from the start node to the goal node. The heuristic of A-Star is the Manhattan Distance that allows movement in four different directions. The result shows that the number of visited nodes will increase if the grid has many obstacle nodes, and the average time of the A-Star pathfinding process is 0.0732 seconds.
Author Pohan, Rahmat Irfan
Candra, Ade
Budiman, Mohammad Andri
Author_xml – sequence: 1
  givenname: Ade
  surname: Candra
  fullname: Candra, Ade
  organization: Faculty of Computer Science and Information Technology, Universitas Sumatera Utara
– sequence: 2
  givenname: Mohammad Andri
  surname: Budiman
  fullname: Budiman, Mohammad Andri
  organization: Faculty of Computer Science and Information Technology, Universitas Sumatera Utara
– sequence: 3
  givenname: Rahmat Irfan
  surname: Pohan
  fullname: Pohan, Rahmat Irfan
  organization: Faculty of Computer Science and Information Technology, Universitas Sumatera Utara
BookMark eNqNkF9LwzAUxYNMcE4_gwXfhLr8aZrkwYcydCoDB9PnEJt0y-iamnbIvr2plYkiuLwkNznn3vPLKRhUrjIAXCB4jSDnY8QSHKdUpGPERSjHEGGYsCMw3L8M9mfOT8Bp06whJGGxISBZXZc2V611VeSKKIsXrfJRVi6dt-1qE4XruWpXha20rZbRVG3MGTguVNmY8699BF7ubp8n9_HsafowyWZxTjBncU6hehVQJcZomvKcam1wTmmSMix0QjDSqRHCMKiZIURwLKgwJsVcKRFKMgK877utarV7V2Upa283yu8kgrKDlx2W7BBlBy-R7OGD9bK31t69bU3TyrXb-iqklTgEgIIySoPqplfl3jWNN4XMbfv5Fa1XtjxgCvvlPzzfVe-0rv6O9jifLH4KZa2LICZ_iP8b8QEuD5kM
CitedBy_id crossref_primary_10_3390_sym14010132
crossref_primary_10_54097_hset_v63i_10886
crossref_primary_10_3390_drones8120701
crossref_primary_10_54097_hset_v46i_7697
crossref_primary_10_54097_n2x2e183
crossref_primary_10_29109_gujsc_1570730
Cites_doi 10.1016/j.eswa.2019.07.029
10.1016/j.eswa.2009.12.023
ContentType Journal Article
Copyright Published under licence by IOP Publishing Ltd
2021. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: Published under licence by IOP Publishing Ltd
– notice: 2021. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID O3W
TSCCA
AAYXX
CITATION
8FD
8FE
8FG
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
H8D
HCIFZ
L7M
P5Z
P62
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
ADTOC
UNPAY
DOI 10.1088/1742-6596/1898/1/012047
DatabaseName Institute of Physics Open Access Journal Titles
IOPscience (Open Access)
CrossRef
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central
Aerospace Database
SciTech Premium Collection
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Unpaywall for CDI: Periodical Content
Unpaywall
DatabaseTitle CrossRef
Publicly Available Content Database
Advanced Technologies & Aerospace Collection
Technology Collection
Technology Research Database
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
Advanced Technologies & Aerospace Database
ProQuest One Applied & Life Sciences
Aerospace Database
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
Advanced Technologies Database with Aerospace
ProQuest One Academic (New)
DatabaseTitleList CrossRef
Publicly Available Content Database
Database_xml – sequence: 1
  dbid: O3W
  name: Institute of Physics Open Access Journal Titles
  url: http://iopscience.iop.org/
  sourceTypes:
    Enrichment Source
    Publisher
– sequence: 2
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
– sequence: 3
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 1742-6596
ExternalDocumentID 10.1088/1742-6596/1898/1/012047
10_1088_1742_6596_1898_1_012047
JPCS_1898_1_012047
GroupedDBID 1JI
29L
2WC
4.4
5B3
5GY
5PX
5VS
7.Q
AAJIO
AAJKP
ABHWH
ACAFW
ACHIP
AEFHF
AEJGL
AFKRA
AFYNE
AIYBF
AKPSB
ALMA_UNASSIGNED_HOLDINGS
ARAPS
ASPBG
ATQHT
AVWKF
AZFZN
BENPR
BGLVJ
CCPQU
CEBXE
CJUJL
CRLBU
CS3
DU5
E3Z
EBS
EDWGO
EQZZN
F5P
FRP
GROUPED_DOAJ
GX1
HCIFZ
HH5
IJHAN
IOP
IZVLO
J9A
KNG
KQ8
LAP
N5L
N9A
O3W
OK1
P2P
PIMPY
PJBAE
RIN
RNS
RO9
ROL
SY9
T37
TR2
TSCCA
UCJ
W28
XSB
~02
AAYXX
AEINN
CITATION
OVT
PHGZM
PHGZT
PQGLB
PUEGO
8FD
8FE
8FG
ABUWG
AZQEC
DWQXO
H8D
L7M
P62
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
02O
1WK
AALHV
ACARI
ADTOC
AERVB
AGQPQ
AHSEE
ARNYC
BBWZM
C1A
EJD
FEDTE
H13
HVGLF
JCGBZ
M48
Q02
S3P
UNPAY
ID FETCH-LOGICAL-c3287-c50ab90a4eed568c5dde2c5546729d4321d6e99e70d7e33982959ee628aa93983
IEDL.DBID IOP
ISSN 1742-6588
1742-6596
IngestDate Sun Sep 07 10:54:54 EDT 2025
Sun Jul 13 03:41:40 EDT 2025
Thu Apr 24 23:05:06 EDT 2025
Wed Oct 01 03:03:26 EDT 2025
Tue Aug 20 22:16:51 EDT 2024
Wed Aug 21 03:33:02 EDT 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.
cc-by
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c3287-c50ab90a4eed568c5dde2c5546729d4321d6e99e70d7e33982959ee628aa93983
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://proxy.k.utb.cz/login?url=https://iopscience.iop.org/article/10.1088/1742-6596/1898/1/012047
PQID 2546095755
PQPubID 4998668
PageCount 6
ParticipantIDs proquest_journals_2546095755
crossref_citationtrail_10_1088_1742_6596_1898_1_012047
unpaywall_primary_10_1088_1742_6596_1898_1_012047
iop_journals_10_1088_1742_6596_1898_1_012047
crossref_primary_10_1088_1742_6596_1898_1_012047
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 20210601
PublicationDateYYYYMMDD 2021-06-01
PublicationDate_xml – month: 06
  year: 2021
  text: 20210601
  day: 01
PublicationDecade 2020
PublicationPlace Bristol
PublicationPlace_xml – name: Bristol
PublicationTitle Journal of physics. Conference series
PublicationTitleAlternate J. Phys.: Conf. Ser
PublicationYear 2021
Publisher IOP Publishing
Publisher_xml – name: IOP Publishing
References Skiena (JPCS_1898_1_012047bib6) 2008
Mocholi (JPCS_1898_1_012047bib1) 2010; 37
Delling (JPCS_1898_1_012047bib5) 2009
Munir (JPCS_1898_1_012047bib4) 1998
Brondani (JPCS_1898_1_012047bib2) 2019; 138
Mathew (JPCS_1898_1_012047bib3) 2015; 47
Cui (JPCS_1898_1_012047bib7) 2011
References_xml – volume: 138
  year: 2019
  ident: JPCS_1898_1_012047bib2
  publication-title: Expert Systems with Applications
  doi: 10.1016/j.eswa.2019.07.029
– year: 2009
  ident: JPCS_1898_1_012047bib5
– start-page: 125
  year: 2011
  ident: JPCS_1898_1_012047bib7
  article-title: A*-based pathfinding in modern computer games
– volume: 37
  year: 2010
  ident: JPCS_1898_1_012047bib1
  publication-title: Expert Systems with Applications
  doi: 10.1016/j.eswa.2009.12.023
– volume: 47
  start-page: 262
  year: 2015
  ident: JPCS_1898_1_012047bib3
– year: 2008
  ident: JPCS_1898_1_012047bib6
– year: 1998
  ident: JPCS_1898_1_012047bib4
SSID ssj0033337
Score 2.3817668
Snippet Pathfinding is the method for determining the shortest path. Pathfinding is widely used in various fields of Computer Science. One of them is game development....
SourceID unpaywall
proquest
crossref
iop
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 12047
SubjectTerms Algorithms
Artificial intelligence
Games
Nodes
Physics
Shortest-path problems
Tree planting
SummonAdditionalLinks – databaseName: ProQuest Central
  dbid: BENPR
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1ZS8NAEB60IvoinlgvAvro0mQ3m2QfRKp4IFiKB_i27NUq1DRqRfz3zqaJtS9q3jbMhmR2M_PNzgVw4FyqfF1zQl2kSWyNINoyRoTm3DjBM5P63OHrTnJ5H1898IcZ6NS5MD6sspaJpaC2Q-PPyFu-bjvCgZTz4-KF-K5R3rtat9BQVWsFe1SWGJuFOeorYzVg7uSs072pZTPDKx2nSFKCujerI77QDKzuiaQVZQKHLZ9W6ruu_NBXs0_DYgqKLrznhfr8UIPBD610vgxLFZwM2uP1X4EZl6_CfBnWad7WgLUn_ulg2AvaBMHla9Ae9PHTRo_PAd7uIgYsPdd5P7hQz24d7s_P7k4vSdUmgRiG9g4xPFRahCpGdceTzHCUWNT46DMEzjZmNLKJE8KloU0dYyKjggvnEpopJXDINqCRD3O3CQHaNzpGZnBNWdzTaGiH2sTOuNiiXFC0CUnNDGmqGuK-lcVAlr7sLJOei9JzUXouykiOudiE8HtiMS6j8feUQ-S2rH6pt7_J96fIr7qnt9MUsrC9JuzUizchnWytJkTfC_rf99z6_ZHbsEh9GEx5cLMDjdHru9tFHDPSe9Xm_AKHW-SB
  priority: 102
  providerName: ProQuest
– databaseName: Unpaywall
  dbid: UNPAY
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bSxwxFD7oSqkvtrYV1xsD9bFxZ3KZmTwO4gWhstAu6FNIMlkV19ll3UX013syl7UjFFsfE84ZkjO5fCfnBrDvXKJ9XnNCXWQIz60kJmeMSCOEdVKkNvGxwz_P49MBP7sQF0vQa2JhWvZ7VM4QMFMSCxn3olRis-eDPXmyDCu-M-zAyuC8n11WYY-esqw0ueBqPLr-_qXWfbR8M560oObHeTHRjw96NPrj1jn-BP1mvJWzye3BfGYO7NOrVI7_MaHPsFYj0CCrlsw6LLniC3woPUHt_Vdg2YtJOxgPg4wgHp0G2ehqPL2ZXd8F2N1H2Fgau4ur4ETfuW8wOD76fXhK6soKxDJUkYgVoTYy1BxvSBGnVuAhR613WEOsnXNGozx2UrokzBPHmEypFNK5mKZaS2yyDegU48JtQoAqkeE4MWEo40ODunloLHfW8RyPEk27EDfyVbZOO-6rX4xUaf5OU-UlorxElJeIilQlkS6EC8ZJlXnjbZYf-ANVvQvv3yb_3iI_6x_-alOoST7swk6zHl5IfRUBBKeJEF2IFmvkX8e59Q6ebVil3p2mfADagc5sOne7iIdmZq_eA88cqPH2
  priority: 102
  providerName: Unpaywall
Title Application of A-Star Algorithm on Pathfinding Game
URI https://iopscience.iop.org/article/10.1088/1742-6596/1898/1/012047
https://www.proquest.com/docview/2546095755
https://doi.org/10.1088/1742-6596/1898/1/012047
UnpaywallVersion publishedVersion
Volume 1898
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVFSB
  databaseName: Free Full-Text Journals in Chemistry
  customDbUrl:
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0033337
  issn: 1742-6596
  databaseCode: HH5
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: http://abc-chemistry.org/
  providerName: ABC ChemistRy
– providerCode: PRVAFT
  databaseName: Open Access Digital Library
  customDbUrl:
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0033337
  issn: 1742-6596
  databaseCode: KQ8
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html
  providerName: Colorado Alliance of Research Libraries
– providerCode: PRVFQY
  databaseName: GFMER Free Medical Journals
  customDbUrl:
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0033337
  issn: 1742-6596
  databaseCode: GX1
  dateStart: 0
  isFulltext: true
  titleUrlDefault: http://www.gfmer.ch/Medical_journals/Free_medical.php
  providerName: Geneva Foundation for Medical Education and Research
– providerCode: PRVIOP
  databaseName: Institute of Physics Open Access Journal Titles
  customDbUrl:
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0033337
  issn: 1742-6596
  databaseCode: O3W
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: http://iopscience.iop.org/
  providerName: IOP Publishing
– providerCode: PRVIOP
  databaseName: IOP Science Platform
  customDbUrl:
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0033337
  issn: 1742-6596
  databaseCode: IOP
  dateStart: 20040601
  isFulltext: true
  titleUrlDefault: https://iopscience.iop.org/
  providerName: IOP Publishing
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl: http://www.proquest.com/pqcentral?accountid=15518
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0033337
  issn: 1742-6596
  databaseCode: BENPR
  dateStart: 20040801
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwED_RTQhe-EYURhUJHnGb-COxH8O0bppEFwEV48myHXcgurTqWiH46znnY1uR0EDkIYqtu8j-yTn_HN-dAV57n5mQ15xQn1jCS6eILRkjygrhvBLSZSF2-N0kPZry41Nxej0WZrFsTf8QH5tEwQ2ErUOcHCGHpiQVKh0lUmFxFOI_edaDXSaRH4cgvpOis8YMr6wJigxKUnY-Xn9-0dYM1cNWbJHPO5tqaX58N_P5tXlofB9c14PG_eTbcLO2Q_fzt-SO_9fFB3CvpalR3mg8hFu-egS3a3dRd_EYWH617x0tZlFOkLSuonx-tlh9XX85j7C6QG5Z74hXZ9GhOfdPYDo--Lh_RNrjF4hjuI4iTsTGqthwnEZFKp1AS0hd8GpDQl5yRpMy9Ur5LC4zz5iSVAnlfUqlMQqL7CnsVIvKP4MI102WY8eEpYzPLC7gY-u4d56XaG8M7UPaQa5dm5s8HJEx1_UeuZQ6IKIDIjogohPdINKH-FJx2aTnuFnlDcKu20_14mbxV1vix8X-h20JvSxnfdjrhsiVaDhqABlsJkQfksth87ftfP5v7XwBd2lwt6l_EO3Bznq18S-RL63tAHpyfDiA3bcHk-L9oP488H7CPmHddFLkn38BJBUDlw
linkProvider IOP Publishing
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1JT9tAFH5iUUUviG5qgLaW2t46ij2L7TmgKlBo2KKoBYnbMFtopeAYEoT4c_1tfePYhFxKL_g2ozcj65vlvTdvA_jkfaZDXnNCfWIId1YS4xgj0ghhvRS5zULs8HEv7Z7ygzNxtgB_mliY4FbZ3InVRe1GNryRt0PedhQHMiG-llckVI0K1tWmhIauSyu4rSrFWB3YcejvblGFG2_tf8P1_kzp3u7JTpfUVQaIZaguECtibWSsOXILkeZW4IGnNjhvodzpOKOJS72UPotd5hmTOZVCep_SXGuJTYbzLsIyZ1yi8re8vdvr_2h4AcMvm4ZkUoK8Pm88zFDtrPtk2k5yic12CGMNVV4e8MfF36NyTvRduSlKfXerh8MHXHBvDVZr8TXqTPfbC1jwxUt4VrmR2vErYJ2ZPTwaDaIOQWH2OuoMLxDKya_LCLv7KHNWlvLiIvquL_1rOH0SwN7AUjEq_FuIUJ8yHMEQhjI-MKjYx8Zybz13eA9p2oK0AUPZOmd5KJ0xVJXtPM9VQFEFFFVAUSVqimIL4vuB5TRtx-NDviDaqj7C48fJP86RH_R3fs5TqNINWrDZLN6MdLaVW5DcL-j__uf6v6f8ACvdk-MjdbTfO9yA5zS44FSPRpuwNLm-8e9QhpqY9_VGjeD8qc_GX1XrIGg
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dT9swED8B0wYv-wTRDbZI2-PcJv5I7McKKIxtrNKGxJtlO25BlLQqrdD21--cj0InTTAtT3F0F9m_2Oef47szwAfvMxPymhPqE0t47hSxOWNEWSGcV0K6LMQOfz1Jj0758Zk4W4HeIhZmPKlNfxtvq0TBFYS1Q5zsIIemJBUq7SRSYbET4j951pnkg1V4VKYrCYF83_qNRWZ4ZVVgZFCUsvHz-vvLlmapVazJEgFdnxcT8_PGjEZ35qLeMxg2rahcUC7b85ltu19_JHj8_2Y-h6c1XY26ldYLWPHFS3hcuo2661fAurf739F4EHUJktdp1B0Nx9OL2flVhI_7yDHLnfFiGB2aK78Jp72DH3tHpD6GgTiG6yniRGysig3H6VSk0gm0iNQF7zYk5jlnNMlTr5TP4jzzjClJlVDep1Qao7DItmCtGBd-GyJcP1mOjROWMj6wuJCPrePeeZ6j3TG0BWkDu3Z1jvJwVMZIl3vlUuqAig6o6ICKTnSFSgviheKkStNxv8pHhF7XQ_b6fvH3S-LH_b3vyxIav0wLdppucisajhxAJpsJ0YJk0XUeWs_X_1bPd_Ckv9_TXz6dfH4DGzR44JT_jHZgbTad-12kUDP7thwfvwG8IQPO
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bSxwxFD7oSqkvtrYV1xsD9bFxZ3KZmTwO4gWhstAu6FNIMlkV19ll3UX013syl7UjFFsfE84ZkjO5fCfnBrDvXKJ9XnNCXWQIz60kJmeMSCOEdVKkNvGxwz_P49MBP7sQF0vQa2JhWvZ7VM4QMFMSCxn3olRis-eDPXmyDCu-M-zAyuC8n11WYY-esqw0ueBqPLr-_qXWfbR8M560oObHeTHRjw96NPrj1jn-BP1mvJWzye3BfGYO7NOrVI7_MaHPsFYj0CCrlsw6LLniC3woPUHt_Vdg2YtJOxgPg4wgHp0G2ehqPL2ZXd8F2N1H2Fgau4ur4ETfuW8wOD76fXhK6soKxDJUkYgVoTYy1BxvSBGnVuAhR613WEOsnXNGozx2UrokzBPHmEypFNK5mKZaS2yyDegU48JtQoAqkeE4MWEo40ODunloLHfW8RyPEk27EDfyVbZOO-6rX4xUaf5OU-UlorxElJeIilQlkS6EC8ZJlXnjbZYf-ANVvQvv3yb_3iI_6x_-alOoST7swk6zHl5IfRUBBKeJEF2IFmvkX8e59Q6ebVil3p2mfADagc5sOne7iIdmZq_eA88cqPH2
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Application+of+A-Star+Algorithm+on+Pathfinding+Game&rft.jtitle=Journal+of+physics.+Conference+series&rft.au=Candra%2C+Ade&rft.au=Budiman%2C+Mohammad+Andri&rft.au=Pohan%2C+Rahmat+Irfan&rft.date=2021-06-01&rft.issn=1742-6588&rft.eissn=1742-6596&rft.volume=1898&rft.issue=1&rft.spage=12047&rft_id=info:doi/10.1088%2F1742-6596%2F1898%2F1%2F012047&rft.externalDBID=n%2Fa&rft.externalDocID=10_1088_1742_6596_1898_1_012047
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1742-6588&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1742-6588&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1742-6588&client=summon