Next Article in Journal
Performance Validation of High-Speed Motor for Electric Turbochargers Using Various Test Methods
Next Article in Special Issue
Business Purchase Prediction Based on XAI and LSTM Neural Networks
Previous Article in Journal
A Knowledge Graph Embedding Based Service Recommendation Method for Service-Based System Development
Previous Article in Special Issue
Load Disaggregation Based on a Bidirectional Dilated Residual Network with Multihead Attention
 
 
Article
Peer-Review Record

Design and Implementation of EinStein Würfelt Nicht Program Monte_Alpha

Electronics 2023, 12(13), 2936; https://doi.org/10.3390/electronics12132936
by Chih-Hung Chen 1,*, Sin-Yi Chiu 2 and Shun-Shii Lin 2
Reviewer 1:
Reviewer 2:
Reviewer 3: Anonymous
Electronics 2023, 12(13), 2936; https://doi.org/10.3390/electronics12132936
Submission received: 26 May 2023 / Revised: 30 June 2023 / Accepted: 30 June 2023 / Published: 4 July 2023
(This article belongs to the Special Issue Recent Advances in Data Science and Information Technology)

Round 1

Reviewer 1 Report

The article presents computing improvements for the game implementation, in a well structured report.

 

Author Response

Please see the attachment.

Author Response File: Author Response.pdf

Reviewer 2 Report

Dear authors, 

the paper is interesting. I have a few suggestions:

- What does it mean "reach the goal" in line 43?

- Line 152 what UTC stands for?

- Why in Figure 3, do you have to consider all the alternatives to move in the first layer? Since you decide how to move after you see the result of the dice, you have just one node "Diven dice points".

- Why consider the binary representation of the states in Eq 5 and 6?

- Why have the positions 0x32, etc, and not just a tuple (0, 4)? In my opinion, using the second type of expression will increase readability.

Best regards

 

Author Response

Please see the attachment.

Author Response File: Author Response.pdf

Reviewer 3 Report

The paper is well structured and written. It presents several updates to an existing engine for playing the EinStein Würfelt Nicht board game, together with extensive testing against other algorithms. I believe its contributions are worthwhile in scope, but limited to the development and optimization of algorithms for playing board-games. In addition, I've noted a few observations for the authors:

  • Introduction must make it clear that when the die lands on a number that is no longer on the board, the player must move a stone with the closest number to the die, not any stone.
  • "validate its chess-playing abilities" -- perhaps its game-playing abilities?
  • Authors must refrain from calling the game board "chessboard". A chessboard has a very precise definition, which this game board does not fulfil. It's best to just call it the "game board".
  • Bitboard representation does not make clear that 0x45 is used as an example and therefore the operations are initially confusing
  • Line 178, please clarify why the given time complexity is O(n), as there are only 6 pieces on the board.

Use of English is fine.

Author Response

Please see the attachment.

Author Response File: Author Response.pdf

Back to TopTop