-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmehta_os.html
385 lines (359 loc) · 17.3 KB
/
mehta_os.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
<!DOCTYPE html>
<html>
<head>
<meta name="description" content="3x3x3 Speedsolving Method - Mehta">
<meta name="keywords" content="3x3, Rubik's cube, algorithm, method, Mehta">
<meta name="author" content="Yash Mehta">
<title>Mehta</title>
<link rel="stylesheet" type="text/css" href="style.css">
<link rel="shortcut icon" type="image/x-icon" href="images/icon.png">
</head>
<body>
<header>
<div class="container">
<div id="branding">
<h1><span class="highlight">Mehta</span></h1>
</div>
<nav>
<ul>
<li>
<div class="dropdown">
<a class="primary" href="index.html">Home</a>
</div>
</li>
<li>
<div class="dropdown">
<a class="primary" href="EOLedge.html">EO-Ledge</a>
</div>
</li>
<li class="current">
<div class="dropdown">
<a class="primary" href="">Variants</a>
<div class="dropdown-content">
<a class="secondary" href="mehta_os.html">Mehta-OS</a>
<a class="secondary" href="mehta_tdr.html">Mehta-TDR</a>
</div>
</div>
</li>
<li>
<div class="dropdown">
<a class="primary" href="examples.html">Examples</a>
</div>
</li>
<li>
<div class="dropdown">
<a class="primary" href="about.html">About</a>
</div>
</li>
</ul>
</nav>
</div>
</header>
<section id="variant-exp">
<div class="container">
<p>The theme of Mehta is to solve a greater fraction of the cube using algorithms; and the way to provide room for creativity in algorithmic steps is option-select. Having a structured option-select system like in Mehta-OS means having a choice between two algorithms on each step, where one could alwyas pick the one that is easier to recognise and/or execute. The flowchart on the <a href="index.html">Home</a> page explains briefly what the four possible paths for Mehta-OS are.</p>
<p>Getting a few abbreviations and definitions out of the way:</p>
<ul>
<li><b>6CO:</b> 6 Corners' Orientation; a ~9 STM algorithm which is usually RU-gen, to orient the remaining 6 corners on the 3x3x3 after EO-ledge.</li>
<li><b>6CP:</b> 6 Corners' Permutation; a ~10 STM algorithm which is usually RUD-gen, to solve the remaining 6 corners on the 3x3x3 after 6CO.</li>
<li><b>APDR:</b> Andreas' Permutation of DR block; an ~8 STM algorithm which is usually RU-gen, to solve the DR-block on the 3x3x3 after 6CO.</li>
<li><b>DCAL:</b> Down Corners After Ledge (aka CAL-STATE); a ~9 STM algorithm which is usually RU-gen, to solve the remaining 2 D layer corners on the 3x3x3 after EO-ledge.</li>
<li><b>CDRLL:</b> Corners of Last Layer (CxLL) with DR edge free; an ~11 STM algorithm, to solve the remaining 4 U-layer corners on the 3x3x3 after DCAL.</li>
<li><b>JTLE:</b> John Tamanas' Last Edge; a ~9 STM algorithm which is usually RU-gen, to orient the remaining 4 U-layer corners on the 3x3x3 as well as solve the DR-edge after DCAL.</li>
<li><b>L5EP:</b> Last 5 Edges' Permutation; an ~8 STM algorithm which is usually MU-gen, to solve the remaining 5 edges on the 3x3x3 after 6CP or CDRLL.</li>
<li><b>PLL:</b> Permutation of Last Layer; a ~13 STM algorithm, to solve the last layer on the 3x3x3 after APDR or JTLE.</li>
</ul>
<p>The number of cases in each set is given in the flowchart. All Mehta-OS algorithms can be found <a href="https://docs.google.com/spreadsheets/d/1qY8c-ypPAn-51pDQOYI-DzpyMPnPAri2qOTh3ZG1fjw/edit#gid=2087327765">here</a>.</p>
</div>
</section>
<section id="rest">
<div class="container">
<p>There are 4 paths in Mehta-OS, named after the unique middle step in each path: Mehta-6CP, Mehta-APDR, Mehta-CDRLL and Mehta-JTLE. The movecount statistics (generated over 60000 X 4 solves using the first algorithm for each case as mentioned in the spreadsheet; hence note these are speed-optimal stats, not move-optimal) for each path are given below:</p>
<table>
<thead>
<th>6CP Path</th>
<th>preAUF (6CO)</th>
<th>6CO</th>
<th>preAUF (6CP)</th>
<th>6CP</th>
<th>preAUF (L5EP)</th>
<th>L5EP</th>
<th>ABF</th>
<th>Total</th>
</thead>
<tr>
<td>Average</td>
<td>0.70</td>
<td>8.56</td>
<td>0.73</td>
<td>9.66</td>
<td>0.72</td>
<td>7.22</td>
<td>1.00</td>
<td>28.59</td>
</tr>
<tr>
<td>Std. Dev.</td>
<td>0.46</td>
<td>1.86</td>
<td>0.44</td>
<td>2.79</td>
<td>0.45</td>
<td>1.74</td>
<td>0.57</td>
<td>3.88</td>
</tr>
<tr>
<td>Median</td>
<td>1</td>
<td>9</td>
<td>1</td>
<td>9</td>
<td>1</td>
<td>7</td>
<td>1</td>
<td>29</td>
</tr>
<tr>
<td>Minimum</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>4</td>
</tr>
<tr>
<td>Maximum</td>
<td>1</td>
<td>12</td>
<td>1</td>
<td>17</td>
<td>1</td>
<td>9</td>
<td>2</td>
<td>41</td>
</tr>
</table>
<table>
<thead>
<th>APDR Path</th>
<th>preAUF (6CO)</th>
<th>6CO</th>
<th>preAUF (APDR)</th>
<th>APDR</th>
<th>preAUF (PLL)</th>
<th>PLL</th>
<th>ABF</th>
<th>Total</th>
</thead>
<tr>
<td>Average</td>
<td>0.70</td>
<td>8.56</td>
<td>0.74</td>
<td>7.26</td>
<td>0.69</td>
<td>12.12</td>
<td>1.00</td>
<td>31.07</td>
</tr>
<tr>
<td>Std. Dev.</td>
<td>0.46</td>
<td>1.83</td>
<td>0.44</td>
<td>2.24</td>
<td>0.46</td>
<td>3.57</td>
<td>0.58</td>
<td>4.66</td>
</tr>
<tr>
<td>Median</td>
<td>1</td>
<td>9</td>
<td>1</td>
<td>7</td>
<td>1</td>
<td>12</td>
<td>1</td>
<td>31</td>
</tr>
<tr>
<td>Minimum</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>4</td>
</tr>
<tr>
<td>Maximum</td>
<td>1</td>
<td>12</td>
<td>1</td>
<td>13</td>
<td>1</td>
<td>21</td>
<td>2</td>
<td>47</td>
</tr>
</table>
<table>
<thead>
<th>CDRLL Path</th>
<th>preAUF (DCAL)</th>
<th>DCAL</th>
<th>preAUF (CDRLL)</th>
<th>CDRLL</th>
<th>preAUF (L5EP)</th>
<th>L5EP</th>
<th>ABF</th>
<th>Total</th>
</thead>
<tr>
<td>Average</td>
<td>0.70</td>
<td>8.22</td>
<td>0.73</td>
<td>10.31</td>
<td>0.72</td>
<td>7.22</td>
<td>1.00</td>
<td>28.89</td>
</tr>
<tr>
<td>Std. Dev.</td>
<td>0.46</td>
<td>1.99</td>
<td>0.44</td>
<td>2.25</td>
<td>0.45</td>
<td>1.74</td>
<td>0.58</td>
<td>3.59</td>
</tr>
<tr>
<td>Median</td>
<td>1</td>
<td>9</td>
<td>1</td>
<td>10</td>
<td>1</td>
<td>7</td>
<td>1</td>
<td>29</td>
</tr>
<tr>
<td>Minimum</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>4</td>
</tr>
<tr>
<td>Maximum</td>
<td>1</td>
<td>13</td>
<td>1</td>
<td>16</td>
<td>1</td>
<td>9</td>
<td>2</td>
<td>41</td>
</tr>
</table>
<table>
<thead>
<th>JTLE Path</th>
<th>preAUF (DCAL)</th>
<th>DCAL</th>
<th>preAUF (JTLE)</th>
<th>JTLE</th>
<th>preAUF (PLL)</th>
<th>PLL</th>
<th>ABF</th>
<th>Total</th>
</thead>
<tr>
<td>Average</td>
<td>0.70</td>
<td>8.22</td>
<td>0.74</td>
<td>9.43</td>
<td>0.70</td>
<td>12.10</td>
<td>1.01</td>
<td>32.89</td>
</tr>
<tr>
<td>Std. Dev.</td>
<td>0.46</td>
<td>1.99</td>
<td>0.44</td>
<td>2.15</td>
<td>0.46</td>
<td>3.60</td>
<td>0.58</td>
<td>4.71</td>
</tr>
<tr>
<td>Median</td>
<td>1</td>
<td>9</td>
<td>1</td>
<td>9</td>
<td>1</td>
<td>12</td>
<td>1</td>
<td>33</td>
</tr>
<tr>
<td>Minimum</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>0</td>
<td>4</td>
</tr>
<tr>
<td>Maximum</td>
<td>1</td>
<td>13</td>
<td>1</td>
<td>13</td>
<td>1</td>
<td>21</td>
<td>2</td>
<td>49</td>
</tr>
</table>
<p>Note that these are algorithmic steps, so the efficiency of the simulation is identical to the efficiency of any solver for each simulation. It should be noted that the most efficient of the 4 paths on average is the 6CP path, followed closely by the CDRLL path.</p>
<p>Now consider a solver that always knows which path to pick for every scramble to get the shortest solution. Running a simulation (of 60000 solves) for such a solver gives the best possible average movecount of Mehta-OS finish to be 26.30 STM (standard deviation of 3.34 STM). Compared to ~29 move finish for 6CP and CDRLL paths, having option select in one's arsenal can chop the movecount by upto ~2.5 STM on average (* This would in practice be slightly lower).</p>
<p>More importantly, this simulation shows that the most efficient solutions are achieved using the 6CP path in 45.5% of the solves, using the CDRLL path in 43.8% of the solves, using the APDR path in 18.7% of the solves, and using the JTLE path in 10.4% of the solves (The sum of these numbers is more than 100% due to ties). This reveals that the default path a Mehta-OS user should choose is either the 6CP path or the CDRLL path (where the user is guaranteed the most efficient OS finish ~45% of the time). Either of these should be the first path the user learns, and any other path the user learns would be add-ons for option select, which depending on the judgement of the user would increase their likelihood of getting the most efficient OS finish appropriately.</p>
<p>6CP-vs-CDRLL: Which path should you learn first / as your default path? 6CP is slightly more efficient CDRLL, and APDR (which is accessible as soon as you learn 6CP) is far more valuable than JTLE (which is accessible on learning CDRLL) as an option-select second path. Additionally, the 6CP path combines very well with known alg-sets like <a href="https://docs.google.com/spreadsheets/d/1D26FLNRhHs5RBXswyfjaKzL_5bboleo6YxYKq3osYGQ/edit#gid=225880606">TTLL</a> and <a href="https://docs.google.com/spreadsheets/d/1S3UBIm31GeaFkrqNY4tth59BYHgc5R80LwaXw0bWv4s/edit#gid=0">HKPLL</a> (the oppotunitity to use these comes up once every 10 solves) as well as set-ups to PLLs, which can serve as additional option-select resources for a sufficiently advanced solver. Anti-APDR (thus ending the solve with <a href="https://docs.google.com/spreadsheets/d/1YMOvh2u0jD-DpbVF5QvvAwjhXJy36wejULeXha13P8w/edit#gid=0">PLL+corner swap</a>, thus having 22 additional cases) is another viable option to cut down on inefficient APDR cases. However, CDRLL is slightly more efficient than 6CP in QTM, and the recognition and algorithms will be very familiar to people coming from backgrounds in CMLL or COLL; while the 6CP recognition is nowhere close to as well researched (except <a href="https://docs.google.com/spreadsheets/d/1iW-BdSZl2zFKCchVvmzVTK9zH2OEAjqAIc-KrKWtskw/edit#gid=0">here</a>). Moreover, it is easier to transition to Mehta-TDR from CDRLL (since DCAL is a subset of TDR; and COLL, which very similar to CDRLL, is a subset of ZBLL). At the end, it is an open debate that could have different answers for different users.</p>
<p>A note on L5EP: Because there are so few L5EP cases, it is advisible to learn L5EP from multiple angles (i.e. the D edge being in DR, DF or DB; all these algorithms are also included in the sheet). This way, if after CDRLL/6CP, the ADF is a D or a D', one could do the ADF before L5EP, giving more time for L5EP recognition, and finally ending with only an AUF instead of an ABF.</p>
<p>While the total number of algorithms required for full Mehta-OS might seem to add up to over 300, not all algorithms need to be learned. Say your default path is DCAL -> CDRLL -> L5EP; the first decision point is whether to do 6CO in place of DCAL so one would be alright memorising only the 6CO algorithms with good recognition and / or execution; the second decision point is at CDRLL or 6CP, so all CDRLL and 6CP would have to be learned but only selected JTLE and APDR algorithms (already marked in the algsheet) should be learned. This allows to use full Mehta-OS to almost the best of its potential without learning all the algorithms.</p>
<p>And finally, choosing to learn only one path (either 6CP or CDRLL) and using only that without any option-select should still give the user a sub-50 movecount on average; which in the right hands could get great results by itself.</p>
</div>
</section>
<footer>
<div class="container">
<p>For improvements or corrections, contact: yashovardhanmehta@gmail.com</p>
</div>
</footer>
</body>
</html>