| Latest revision |
Your text |
| Line 1: |
Line 1: |
| − | {{WIP}}
| |
| | {{Stub}} | | {{Stub}} |
| | [[File:HOC_Chip.png|right|thumb|Chips will be used for HOC units similar to equipment for T-Dolls]] | | [[File:HOC_Chip.png|right|thumb|Chips will be used for HOC units similar to equipment for T-Dolls]] |
| Line 16: |
Line 15: |
| | * Talk about HOC units which are not able to reach all stats full with Chips | | * Talk about HOC units which are not able to reach all stats full with Chips |
| | ** Important: Note this on the HOC unit's page, too! | | ** Important: Note this on the HOC unit's page, too! |
| − |
| |
| − | __TOC__
| |
| − |
| |
| − | == General ==
| |
| − | Chips can provide plentiful status increase by installing on the HOC chip matrices. Each HOC unit has its own matrix of different colors or shapes, also, every HOC unit has their own maximum stats that chips can provide. Our discussion will mainly focus on HOC units reaching rarity 5 with full matrices.
| |
| − | For players don't raise their HOC units to rarity 5, it is advised to just make best use of every space in your HOC's matrix. Hence there is no HOC units except PP-93(which will be released soon) could reach its maximum chip stats before rarity 5.
| |
| − | So it is important to insert chips with appropriate amount, shapes and colors to maximum your HOC stats.
| |
| − |
| |
| − | ==Origin==
| |
| − | ===Pentomino===
| |
| − | Inserting chips is actually one derivative form of the 'Pentomino' puzzle<ref name="pentomino">Wikipedia entry on [[wikipedia:Pentomino|Pentomino]]</ref>.Deriving from the Greek word '5' and 'domino', the puzzle mainly focusing on finding each and every way to fill the puzzle with the maximum number of pentominos.<br>
| |
| − | So, in order to solve these pentominos with different stats or colors, we need to introduce some interesting algorithms to make our calculation clean and clear.
| |
| − |
| |
| − | ==Calculation==
| |
| − |
| |
| − | ===Abstraction===
| |
| − | First we need to transfer this puzzle into a more specific mathematic question for our further calculation. We can stretch this two-dimensional matrix into an singel dimensional array. Then we define every little block in the matrix as '1' or '0', which stands for non-empty or empty.<br>
| |
| − | * Here's an easy example to better understand this model.
| |
| − | <div style='text-align: center;>
| |
| − | {| class="gf-table style="width: 85%; border-style: solid; border-width: 3px"
| |
| − | |-
| |
| − | |{{HOCMatrix|chipcolor=blue
| |
| − | |data=
| |
| − | 1,1,1;
| |
| − | 1,1,0;
| |
| − | 0,0,0;}}
| |
| − | |{{HOCMatrix|chipcolor=blue
| |
| − | |data=
| |
| − | 0,1,1,0;
| |
| − | 0,0,1,0;
| |
| − | 0,0,1,0;
| |
| − | 0,0,1,1;}}
| |
| − | |{{HOCMatrix|chipcolor=blue
| |
| − | |data=
| |
| − | 1,1,1,0,0;
| |
| − | 0,0,1,0,0;
| |
| − | 0,0,1,0,0;
| |
| − | 0,0,1,0,0;
| |
| − | 0,0,1,1,1;}}
| |
| − | |-
| |
| − | | • {1,1,1,1,1,0,0,0,0}.
| |
| − | | • {0,1,1,0,0,0,1,0,0,0,1,0,0,0,1,1}.
| |
| − | | • {1,1,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,1,1}.
| |
| − | |-
| |
| − | |}
| |
| − | </div>
| |
| − |
| |
| − | Certainly, all elements in the array will be '1' for a full chip loop, now that we have our mathematic theory basis, it seems easy to solve this problem.
| |
| − |
| |
| − | Imagine this is a certain full chip loop(actually BGM-71's for hers is the easiest to show)
| |
| − | ===Exact cover===
| |
| − |
| |
| − | ===Np problem===
| |
| − |
| |
| − | ===DLX===
| |
| − |
| |
| − | ===Chip stats===
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − | This page is still being edited, more contents would be added after the update of the HOC-matrix template.
| |
| − |
| |
| − |
| |
| − |
| |
| | | | |
| | | | |
