Soft set theory was defined by Molodtsov in 1999 to model problems involving uncertainty. In this study, soft sequences are defined as a special case of soft sets. It is defined as a function from the set of positive integers to the power set of a universe. As a new concept, connected and disconnected soft sequences, chained soft sequences, centered soft sequences, increasing soft sequences, decreasing soft sequences, and ordered soft sequences are defined. Finally, soft sequences are applied to game theory. Using chained soft sequences, no chance (NC) backgammon —a zero-sum, strategic, and intelligence game — is played.
Primary Language | English |
---|---|
Subjects | Mathematical Logic, Set Theory, Lattices and Universal Algebra |
Journal Section | Research Article |
Authors | |
Early Pub Date | June 30, 2025 |
Publication Date | June 30, 2025 |
Submission Date | March 14, 2025 |
Acceptance Date | June 3, 2025 |
Published in Issue | Year 2025 Volume: 11 Issue: 2 |