# Programming: right pattern for storing state system history

**URL:** <https://boards.straightdope.com/t/programming-right-pattern-for-storing-state-system-history/658593>\
**Category:** Factual Questions\
**Created:** [May 17, 2013, 11:24am UTC](https://boards.straightdope.com/t/programming-right-pattern-for-storing-state-system-history/658593 "2013-05-17T11:24:24Z")\
**Posts on this page:** 1\
**Page:** 2

<div class="post-metadata">

**Author:** ![Mijin](https://sea3.discourse-cdn.com/straightdope/user_avatar/boards.straightdope.com/mijin/32/9369_2.png) [@Mijin](https://boards.straightdope.com/u/Mijin)\
**Post date:** [May 18, 2013, 6:54pm UTC](https://boards.straightdope.com/t/programming-right-pattern-for-storing-state-system-history/658593/21 "2013-05-18T18:54:56Z")

</div>

> [@septimus](#):
>
> In that case, your design problem might be to fit as many such cached positions as possible into a given amount of memory. But that is a very different problem than posed in OP.

It’s true; until I thought this all through out loud, I thought that I may be able to store my histories using a well-known pattern and then deal with AI in a problem-specific way.

Now I think a true solution will be more problem-specific in terms of how I structure both the past and future data. I accept that it’s not really a GQ any more, or indeed a question anyone can answer without analysing the source.

[Previous page](https://boards.straightdope.com/t/programming-right-pattern-for-storing-state-system-history/658593.md?page=1)
