View of A Simplified Variant of Chess for which a Short Program Computes a Non-trivial Upper Bound for the Number of Reachable Positions Obtained from 65141475298198504104226577310812726424036 Naturally Defined Initial Configurations of Pieces

Return to Article Details A Simplified Variant of Chess for which a Short Program Computes a Non-trivial Upper Bound for the Number of Reachable Positions Obtained from 65141475298198504104226577310812726424036 Naturally Defined Initial Configurations of Pieces Download PDF