An Upper Bound for the Number of Reachable Positions

@article{Chinchalkar1996AnUB,
  title={An Upper Bound for the Number of Reachable Positions},
  author={S. Chinchalkar},
  journal={J. Int. Comput. Games Assoc.},
  year={1996},
  volume={19},
  pages={181-183}
}
  • S. Chinchalkar
  • Published 1996
  • Computer Science
  • J. Int. Comput. Games Assoc.
Designing Intelligent Agents to Judge Intrinsic Quality of Human Decisions
Hall's Marriage Theorem and Pawn Diagrams
SentiMATE: Learning to play Chess through Natural Language Processing
Tasks for aligning human and machine planning
...
1
2
3
4
5
...