Peer Review History: A Simplified Variant of Chess for which a Short Program Computes a Non-trivial Upper Bound for the Number of Reachable Positions Obtained from 65141475298198504104226577310812726424- 036 Naturally Defined Initial Configurations of Pieces

Editor(s):

(1) Dr. Nikolaos D. Bagis, Aristotelian University of Thessaloniki, Greece.

(2) Dr. Jaya Bishwal, Professor, University of North Carolina at Charlotte, USA.

Reviewers:

(1) Yuri Nikitich Lovyagin, Saint Peterburg University, Russia.

(2) José Gabriel Lopes, Instituto Politécnico de Lisboa, Instituto Superior de Engenharia de Lisboa, Portugal.

(3) Wondimu Tekalign, Savannah State University, USA.

(4) Luay Hashem Abbud, Al-Mustaqbal University College, Iraq.

(5) Angelo Marcelo Tusset, Federal University of Technology, Brazil.

Additional Reviewers:

(1) M. Molavi-Arabshahi, IUST, Iran.

Open Peer Review Policy: Click Here

Specific Comment:

Average Peer review marks at initial stage: 7.4/10

Average Peer review marks at publication stage: 9/10

Peer Review History:


Stage 1 | Original Manuscript | File 1 | NA


Stage 2 | Peer review report_1 (Yuri Nikitich Lovyagin, Russia) | File 1 | NA


Stage 2 | Peer review report_2 (José Gabriel Lopes, Portugal) | File 1 | NA


Stage 2 | Peer review report_3 (Wondimu Tekalign, USA) | File 1 | NA


Stage 2 | Peer review report_4 (Luay Hashem Abbud, Iraq) | File 1 | NA


Stage 2 | Peer review report_5 (Angelo Marcelo Tusset, Brazil) | File 1 | NA


Stage 2 | Revised_MS_v1_and_Feedback_v1 | File 1 | File 2


Stage 3 | Comment_Editor_1_v1 | File 1 | NA


Stage 3 | Comment_Editor_2_v1 | File 1 | NA


Posted in Review History.