# steepest ascent

Published articles for steepest ascent.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Optimally Stacking the Deck--Texas Hold 'Em

DevFeed: [Optimally Stacking the Deck--Texas Hold 'Em](<https://devfeed.tech/articles/optimally-stacking-the-deck-texas-hold-em-40269.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2012/04/09/optimal-stacking-hold-em/>)

Published: 2012-04-09T09:00:26Z

Content type: article

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [math](<https://devfeed.tech/topics/math.md>), [Programming](<https://devfeed.tech/topics/programming.md>)

Tags: [card-games](<https://devfeed.tech/tags/card-games.md>), [fairness](<https://devfeed.tech/tags/fairness.md>), [gambling](<https://devfeed.tech/tags/gambling.md>), [permutations](<https://devfeed.tech/tags/permutations.md>), [poker](<https://devfeed.tech/tags/poker.md>), [steepest-ascent](<https://devfeed.tech/tags/steepest-ascent.md>), [texas-hold-em](<https://devfeed.tech/tags/texas-hold-em.md>)

### AI overview

The article solves a combinatorial puzzle about arranging a standard two-player Texas Hold 'Em deck so that one player wins regardless of where the deck is cut. It explains how cutting the deck normally supports fairness and frames optimal stackings as a measure of game complexity.

### Source excerpt

Main Theorem: There exist optimal stackings for standard two-player Texas Hold 'Em. A Puzzle is Solved (and then some!) It's been quite a while since we first formulated the idea of an optimal stacking. In the mean time, we've gotten distracted with graduate school, preliminary exams, and the host of other interesting projects that have been going on here at Math ∩ Programming. And so months later, after traversing the homotopic hills of topology and projective plains of algebra, we've finally found time to solve the problem.