This article is within the scope of WikiProject Video games, a collaborative effort to improve the coverage of video games on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Video gamesWikipedia:WikiProject Video gamesTemplate:WikiProject Video gamesvideo game
This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
Can all Spider Solitaire games be won, as in Free Cell, or is it more like original Solitaire in which all games are not beatable?76.4.88.13202:20, 19 April 2007 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2007-04-19T02:20:00.000Z","author":"76.4.88.132","type":"comment","level":1,"id":"c-76.4.88.132-2007-04-19T02:20:00.000Z-(Comment)","replies":["c-70.2.198.32-2008-08-07T01:50:00.000Z-76.4.88.132-2007-04-19T02:20:00.000Z"]}}-->
Not all FreeCell games can be won either, and I think this was shown several years ago. There are several proofs and examples of non-winnable FreeCell deals on the net that you can google. —Preceding unsigned comment added by 70.2.198.32 (talk) 01:50, 7 August 2008 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2008-08-07T01:50:00.000Z","author":"70.2.198.32","type":"comment","level":5,"id":"c-70.2.198.32-2008-08-07T01:50:00.000Z-76.4.88.132-2007-04-19T02:20:00.000Z","replies":[]}}-->
not all spider solitaire games can be won and the lack of dealing onto open spaces is a feature of the game not a fault. 129.67.19.252 —Preceding comment was added at 01:42, 16 October 2007 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2007-10-16T01:42:00.000Z","author":"129.67.19.252","type":"comment","level":1,"id":"c-129.67.19.252-2007-10-16T01:42:00.000Z-(Comment)","replies":[]}}-->
I believe I've substantially improved this article by providing a mathematical basis for the highest scores along with other changes and additions. I've added sections on strategy for winning and strategy for getting the highest score. I've tried to add references. Most spider solitaire strategy discussions are on the internet. I could find only one book which was a kindle book. CJMoynihanPHD (talk) 00:28, 2 June 2013 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2013-06-02T00:28:00.000Z","author":"CJMoynihanPHD","type":"comment","level":1,"id":"c-CJMoynihanPHD-2013-06-02T00:28:00.000Z-Article_quality","replies":[]}}-->
The article states that the maximum possible score is 1254. My high score is 1278. I don't know whether this is because the scoring system in vista is different or if something went wrong or if the calculations for the maximum score here are wrong. The calculations seem logical to me though. Jakjawagon (talk) 17:14, 26 November 2007 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2007-11-26T17:14:00.000Z","author":"Jakjawagon","type":"comment","level":1,"id":"c-Jakjawagon-2007-11-26T17:14:00.000Z-Scoring","replies":["c-206.53.65.108-2008-07-03T02:33:00.000Z-Jakjawagon-2007-11-26T17:14:00.000Z"]}}-->
Also, I got a score of 1,253 with something like 180 moves. 206.53.65.108 (talk) 02:33, 3 July 2008 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2008-07-03T02:33:00.000Z","author":"206.53.65.108","type":"comment","level":2,"id":"c-206.53.65.108-2008-07-03T02:33:00.000Z-Jakjawagon-2007-11-26T17:14:00.000Z","replies":[]}}-->
the total score is 1300 (500 point to start, then 100 for each of the 8 suits removed. 1278 would only be possible if you only moved 22 cards. —Preceding unsigned comment added by 98.119.141.62 (talk) 04:27, 11 February 2009 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2009-02-11T04:27:00.000Z","author":"98.119.141.62","type":"comment","level":1,"id":"c-98.119.141.62-2009-02-11T04:27:00.000Z-Scoring","replies":[]}}-->
Currently it says highest possible score is 1293 then says someone got 1295 - clearly a contradiction Ziqidel (talk) 15:33, 22 June 2011 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2011-06-22T15:33:00.000Z","author":"Ziqidel","type":"comment","level":1,"id":"c-Ziqidel-2011-06-22T15:33:00.000Z-Scoring","replies":[]}}-->
Now it says 1351 and my highest score is 1362, someone keeps changing it back wrong — Preceding unsigned comment added by 2.125.150.234 (talk) 22:15, 6 July 2011 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2011-07-06T22:15:00.000Z","author":"2.125.150.234","type":"comment","level":1,"id":"c-2.125.150.234-2011-07-06T22:15:00.000Z-Scoring","replies":[]}}-->
Scores above a certain threshold must be due to a computer glitch. The maximum possible points are (500+800-number of moves). So, 1300 minus the minimum number of moves. The minimum number of moves would depend on a few factors:
1. how many cards are already stacked
2. how many cards are dealt in order
3. how many moves it takes to put turn over the remaining cards
However, it's not Wikipedia's job to determine this but to quote outside, reliable sources. The maximum score without cards already together is 1204. Any score higher than that is just "luck" as some cards may fall into place. The maximum highest score is very, very unlikely to occur. What are the odds of all the stacks starting with Kings, Queens, Jacks, 10s, 9s, then deal the six deals at 8, 7, 6, 5, 4, 3. Then you'd still need to move the twos and aces, plus the extra two stacks would have to be undone.Ryoung12218:24, 31 August 2011 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2011-08-31T18:24:00.000Z","author":"Ryoung122","type":"comment","level":1,"id":"c-Ryoung122-2011-08-31T18:24:00.000Z-Scoring","replies":[]}}-->
I've got the same question. I played the one suit on MS spider and got a score of 1360. I didn't cheat, the cards just fell right. I've looked all over the web and gotten the same answer of 1254 as the highest possible score. Did they change the scoring system for Vista?68.19.237.68 (talk) 05:50, 25 October 2009 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2009-10-25T05:50:00.000Z","author":"68.19.237.68","type":"comment","level":1,"id":"c-68.19.237.68-2009-10-25T05:50:00.000Z-High_score","replies":[]}}-->
plese tell about the minimum possible moves..somebody please telll.. my head is breaking.. i played many times in xp. but can do upto 100 moves minimum..is it possible to win before this........
kathik —Preceding unsigned comment added by 203.99.195.98 (talk) 10:29, 27 October 2009 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2009-10-27T10:29:00.000Z","author":"203.99.195.98","type":"comment","level":1,"id":"c-203.99.195.98-2009-10-27T10:29:00.000Z-High_score","replies":[]}}-->
to keep it simple i have played spider advanced on vista i completed the game in 152moves giveing a score of 1148 is this a world record? —Preceding unsigned comment added by 89.241.211.229 (talk) 16:38, 10 February 2010 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2010-02-10T16:38:00.000Z","author":"89.241.211.229","type":"comment","level":1,"id":"c-89.241.211.229-2010-02-10T16:38:00.000Z-High_score","replies":[]}}-->
I've scored a 1289 on Easy, that's my highest score, I played on vista, if you want a screen shot email me [email protected]—Preceding unsigned comment added by 99.73.98.66 (talk) 21:13, 14 October 2010 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2010-10-14T21:13:00.000Z","author":"99.73.98.66","type":"comment","level":1,"id":"c-99.73.98.66-2010-10-14T21:13:00.000Z-High_score","replies":[]}}-->
my highest score is 1290.... :D —Preceding unsigned comment added by 89.40.29.123 (talk) 10:08, 6 June 2010 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2010-06-06T10:08:00.000Z","author":"89.40.29.123","type":"comment","level":1,"id":"c-89.40.29.123-2010-06-06T10:08:00.000Z-High_score","replies":["c-Hugowolf-2010-08-24T04:37:00.000Z-89.40.29.123-2010-06-06T10:08:00.000Z"]}}-->
I have a recorded highest score of 1274. Getting scores above 1254 is due to a glitch in the operating system or Spider Solitaire itself. It happens when you complete a stack and the 100 points gained from it are recorded twice. —Preceding unsigned comment added by Hugowolf (talk • contribs) 04:37, 24 August 2010 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2010-08-24T04:37:00.000Z","author":"Hugowolf","type":"comment","level":2,"id":"c-Hugowolf-2010-08-24T04:37:00.000Z-89.40.29.123-2010-06-06T10:08:00.000Z","replies":[]}}-->
My high score on the advanced spider is 1333 and 267 moves. That happened today. Is it possible there is a bonus when finishing fast? It did seem like I finished that one pretty quick. I took a pic for proof. My high score on the intermediate was 1632. I've reset those scores since then trying to figure out how this is possible. — Preceding unsigned comment added by 75.88.27.245 (talk) 22:55, 17 August 2012 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2012-08-17T22:55:00.000Z","author":"75.88.27.245","type":"comment","level":1,"id":"c-75.88.27.245-2012-08-17T22:55:00.000Z-High_score","replies":[]}}-->
Pressing "M" to see all available moves is not a "cheat". It's available on the game menu. It is also explained in the help file, along with the information that you can also click on the score box at the bottom for the same action69.37.68.72 (talk) 11:24, 10 August 2010 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2010-08-10T11:24:00.000Z","author":"69.37.68.72","type":"comment","level":1,"id":"c-69.37.68.72-2010-08-10T11:24:00.000Z-\"Cheat\"","replies":[]}}-->
I don't know how it has happened but I have a highest score of 1450. This was achieved 23/12/2010. —Preceding unsigned comment added by 124.178.133.154 (talk) 05:04, 8 February 2011 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2011-02-08T05:04:00.000Z","author":"124.178.133.154","type":"comment","level":1,"id":"c-124.178.133.154-2011-02-08T05:04:00.000Z-\"Cheat\"","replies":[]}}-->
My dad surpass the score of 1254,it was 5663.XD — Preceding unsigned comment added by 74.178.176.128 (talk) 14:23, 26 October 2011 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2011-10-26T14:23:00.000Z","author":"74.178.176.128","type":"comment","level":1,"id":"c-74.178.176.128-2011-10-26T14:23:00.000Z-HA!","replies":[]}}-->
__DTSUBSCRIBEBUTTONDESKTOP__{"headingLevel":2,"name":"h-85.210.11.154-2012-05-27T20:34:00.000Z","type":"heading","level":0,"id":"h-\"Windows_Vista_also_included_a_new_feature_which_tells_the_user_that_there_are_n-2012-05-27T20:34:00.000Z","replies":["c-85.210.11.154-2012-05-27T20:34:00.000Z-\"Windows_Vista_also_included_a_new_feature_which_tells_the_user_that_there_are_n"],"text":"\"Windows Vista also included a new feature which tells the user that there are no more moves even when there are.\"","linkableTitle":"\"Windows Vista also included a new feature which tells the user that there are no more moves even when there are.\""}-->
"Windows Vista also included a new feature which tells the user that there are no more moves even when there are."
__DTSUBSCRIBEBUTTONMOBILE__{"headingLevel":2,"name":"h-85.210.11.154-2012-05-27T20:34:00.000Z","type":"heading","level":0,"id":"h-\"Windows_Vista_also_included_a_new_feature_which_tells_the_user_that_there_are_n-2012-05-27T20:34:00.000Z","replies":["c-85.210.11.154-2012-05-27T20:34:00.000Z-\"Windows_Vista_also_included_a_new_feature_which_tells_the_user_that_there_are_n"],"text":"\"Windows Vista also included a new feature which tells the user that there are no more moves even when there are.\"","linkableTitle":"\"Windows Vista also included a new feature which tells the user that there are no more moves even when there are.\""}-->
"Windows Vista also included a new feature which tells the user that there are no more moves even when there are." that is not a feature, it is a defect. Calling it a feature is sarcastic geek-speek, not appropriate for an encyclopedia — Preceding unsigned comment added by 85.210.11.154 (talk) 20:34, 27 May 2012 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2012-05-27T20:34:00.000Z","author":"85.210.11.154","type":"comment","level":1,"id":"c-85.210.11.154-2012-05-27T20:34:00.000Z-\"Windows_Vista_also_included_a_new_feature_which_tells_the_user_that_there_are_n","replies":[]}}-->
the highest possible score without hacking or cheating is unlimited. i have a high score right now of 13,232 and could go as high as i want. there is a glitch in the game (windows 7 version) that allows you to score this type of score without any cheating. i had been trying to figure out what the glitch was from having previously scoring in the high 1200's and it took almost 1000 games to find it , but find it i did. the glitch is when you are playing and your last move is a stack removal and it results in a "no more moves" screen , close the box with the "x" and then select undo and it will NOT remove the 100 points when it undoes the stack.
note that this cannot be the very last move and that there must be cards in each position.
i stopped at 13k , was just trying to see if it would go into five digits for the score, would be interesting to see if it will go into the millions:) 66.177.144.177 (talk) 14:47, 7 January 2013 (UTC)
On 3/27/13 i recorded a high score of 1,000,299 that took a month of casual playing to achieve with a total playing time of roughly 17 hours on the one game. the score was reached by following my method above and just was done to see if it would record a 7 figure number score.screen shot is available from gjbon1@yahoo[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2013-01-07T14:47:00.000Z","author":"66.177.144.177","type":"comment","level":1,"id":"c-66.177.144.177-2013-01-07T14:47:00.000Z-highest_score","replies":[]}}-->
__DTSUBSCRIBEBUTTONDESKTOP__{"headingLevel":2,"name":"h-Dogmaticeclectic-2013-07-14T21:58:00.000Z","type":"heading","level":0,"id":"h-Regarding_the_tags-2013-07-14T21:58:00.000Z","replies":["c-Dogmaticeclectic-2013-07-14T21:58:00.000Z-Regarding_the_tags"],"text":"Regarding the tags","linkableTitle":"Regarding the tags"}-->
__DTSUBSCRIBEBUTTONMOBILE__{"headingLevel":2,"name":"h-Dogmaticeclectic-2013-07-14T21:58:00.000Z","type":"heading","level":0,"id":"h-Regarding_the_tags-2013-07-14T21:58:00.000Z","replies":["c-Dogmaticeclectic-2013-07-14T21:58:00.000Z-Regarding_the_tags"],"text":"Regarding the tags","linkableTitle":"Regarding the tags"}-->
There is absolutely no need to tag every single sentence with citation needed if a single additional references tag works for the article in general. It's obvious to which sentences a single additional references tag at the top of the article applies: all those currently without references. Dogmaticeclectic (talk) 21:58, 14 July 2013 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2013-07-14T21:58:00.000Z","author":"Dogmaticeclectic","type":"comment","level":1,"id":"c-Dogmaticeclectic-2013-07-14T21:58:00.000Z-Regarding_the_tags","replies":["c-Unscintillating-2013-07-15T00:31:00.000Z-Dogmaticeclectic-2013-07-14T21:58:00.000Z","c-Unscintillating-2013-07-15T00:31:00.000Z-Dogmaticeclectic-2013-07-14T21:58:00.000Z-1"]}}-->
The problem is that a single article tag is so vague that it is not actionable. As discussed recently at WT:V, under WP:BURDEN, it does not constitute a "challenge", because it is too vague. It just says that somebody should do something. The same is true of a tag placed on a section. It is not the case that every sentence in an article or section must have a reference the moment that an article or section tag is placed. The tag can be challenged just like any other part of the article. Unscintillating (talk) 00:31, 15 July 2013 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2013-07-15T00:31:00.000Z","author":"Unscintillating","type":"comment","level":2,"id":"c-Unscintillating-2013-07-15T00:31:00.000Z-Dogmaticeclectic-2013-07-14T21:58:00.000Z","replies":[]}}-->
Each inline tag I placed was actionable, meaning they were easy to research and easy to remove. Unscintillating (talk) 00:31, 15 July 2013 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2013-07-15T00:31:00.000Z","author":"Unscintillating","type":"comment","level":2,"id":"c-Unscintillating-2013-07-15T00:31:00.000Z-Dogmaticeclectic-2013-07-14T21:58:00.000Z-1","replies":["c-Dogmaticeclectic-2013-07-15T17:00:00.000Z-Unscintillating-2013-07-15T00:31:00.000Z"]}}-->
What is the point of the additional references tag then? Clearly there is a consensus that there is in fact a point, since it continues to exist. Dogmaticeclectic (talk) 17:00, 15 July 2013 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2013-07-15T17:00:00.000Z","author":"Dogmaticeclectic","type":"comment","level":3,"id":"c-Dogmaticeclectic-2013-07-15T17:00:00.000Z-Unscintillating-2013-07-15T00:31:00.000Z","replies":["c-Unscintillating-2013-07-15T23:53:00.000Z-Dogmaticeclectic-2013-07-15T17:00:00.000Z"]}}-->
No, there is no article tag now, references were added. If somebody wants to challenge any other points in the article I requested in the edit summary that they use inline tags for clarity. Unscintillating (talk) 23:53, 15 July 2013 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2013-07-15T23:53:00.000Z","author":"Unscintillating","type":"comment","level":4,"id":"c-Unscintillating-2013-07-15T23:53:00.000Z-Dogmaticeclectic-2013-07-15T17:00:00.000Z","replies":["c-Dogmaticeclectic-2013-07-16T13:31:00.000Z-Unscintillating-2013-07-15T23:53:00.000Z"]}}-->
I was referring to the continued existence of the tag in general. If the Wikipedia community actually agreed with you, clearly there would be no point for it to exist. Dogmaticeclectic (talk) 13:31, 16 July 2013 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2013-07-16T13:31:00.000Z","author":"Dogmaticeclectic","type":"comment","level":5,"id":"c-Dogmaticeclectic-2013-07-16T13:31:00.000Z-Unscintillating-2013-07-15T23:53:00.000Z","replies":["c-Unscintillating-2013-07-16T23:57:00.000Z-Dogmaticeclectic-2013-07-16T13:31:00.000Z"]}}-->
I don't see any representatives for the community here, except for you and me. Unscintillating (talk) 23:57, 16 July 2013 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2013-07-16T23:57:00.000Z","author":"Unscintillating","type":"comment","level":6,"id":"c-Unscintillating-2013-07-16T23:57:00.000Z-Dogmaticeclectic-2013-07-16T13:31:00.000Z","replies":[]}}-->
Dan Gosling Informasi pribadiNama lengkap Daniel GoslingTanggal lahir 2 Februari 1990 (umur 34)Tempat lahir Brixham, InggrisTinggi 5 ft 10 in (1,78 m)Posisi bermain Gelandang, BekInformasi klubKlub saat ini BournemouthNomor 4Karier junior0000–2003 Brixham United2003–2006 Plymouth ArgyleKarier senior*Tahun Tim Tampil (Gol)2006–2008 Plymouth Argyle 22 (2)2008–2010 Everton 22 (4)2010–2014 Newcastle United 24 (1)2013–2014 → Blackpool (pinjaman) 14 (2)2014– AFC...
العلاقات الأرمينية الكوستاريكية أرمينيا كوستاريكا أرمينيا كوستاريكا تعديل مصدري - تعديل العلاقات الأرمينية الكوستاريكية هي العلاقات الثنائية التي تجمع بين أرمينيا وكوستاريكا.[1][2][3][4][5] مقارنة بين البلدين هذه مقارنة عامة ومرجعية لل�...
Православие на Гавайях Первая православная церковь на Гавайях, 1815 Территории Юрисдикция (территория) США Медиафайлы на Викискладе Информация в Викиданных ? Православие на Гавайских островах — православное христианство в штате Гавайи, США. Продолжается с на...
American mathematician Pavel EtingofBorn1969Kyiv, Ukrainian SSRAlma materYale UniversityAwards Fellow, American Mathematical Society (2012) AAAS Fellow (2016) Scientific careerFieldsMathematicsInstitutionsMITThesis Representation theory and holonomic Systems (1994)Doctoral advisorIgor Frenkel Websitemath.mit.edu/~etingof/ Pavel Ilyich Etingof (Russian: Павел Ильич Этингоф; born 1969) is an American mathematician of Russian-Ukrainian origin. He does research on the ...
Bahasa Arab LebanonDituturkan diLebanonPenutur Rumpun bahasaAfroasiatik SemitikSemitik BaratSemitik TengahSemitik Selatan-TengahArabBahasa Arab Lebanon Sistem penulisanAksara ArabStatus resmiBahasa resmi ditidak adaDiatur olehtidak adaKode bahasaISO 639-2araISO 639-3apcQIDQ1516642Lokasi penuturanLokasi penuturan Bahasa Arab LebanonPeta bahasa lain Portal Bahasa Sunting kotak info • L • B • PWBantuan penggunaan templat ini Cari artikel bahasa Cari...
Johann Stamitz Jan Václav Antonín Stamic, komponis Bohemia tokoh aliran klasik sebelum Mozart. Ia lahir tahun 1717 dan wafat tahun 1757. Di Mannheim tempatnya wafat, ia pernah bekerja sebagai konsermester dan dirigen, dan untuknya ia menjadi figur penting dari aliran Mennheimer. Sebagai tokoh klasik, ia dicatat melalui beberapa penghormatan, yaitu bahwa ia menentukan akan bangkitnya suatu perkembangan ke arah simfoni, menempatkan menuet sebagai bagian ketiga dari simfoni, serta menata orkes...
Tour d'Espagne 1982GénéralitésCourse 37e Tour d'EspagneCompétition Super Prestige Pernod 1982 (d)Étapes 19Date 20 avril - 9 mai 1982Distance 3 441,7 kmPays traversé(s) EspagneLieu de départ Saint-Jacques-de-CompostelleLieu d'arrivée MadridCoureurs au départ 100Coureurs à l'arrivée 76Vitesse moyenne 35,929 km/hRésultatsVainqueur Marino LejarretaDeuxième Michel PollentierTroisième Sven-Åke NilssonClassement par points Stefan MutterMeilleur grimpeur José Luis Lagu�...
Untuk pekon di Lampung, Indonesia, lihat Teba, Kota Agung Timur, Tanggamus. Untuk desa di Nusa Tenggara Timur, Indonesia, lihat Teba, Biboki Tanpah, Timor Tengah Utara. Teba adalah kotamadya (pueblo/municipio) di Spanyol. Terletak di lingkaran luar sierra yang berada di timur laut Ronda, sekitar 15 kilometer di utara Ardales, kota berpenduduk 4.300 jiwa ini adalah bagian comarca (distrik) Guadalteba, Provinsi Málaga, Andalucia. Pertempuran Teba terjadi dekat kota ini, yang berlangsung pada t...
The IBM international chess tournament was a series of very strong chess tournaments held in the Amsterdam, Netherlands from 1961 to 1981, and was sponsored by IBM. The list of winners of the main group includes five world champions. Parallel there was quite often a tournament IBM-B, always with (future or former) strong grandmasters - and local Dutch players to play against foreign titleholders, apart from the major A section. By 1963, there were 120 participants in the IBM Amsterdam tournam...
Image of carbon film surface obtained by FOS method (AFM, tapping mode). Carbon clusters (hills) and intercluster spaces (pits) are used as surface features. Feature-oriented scanning (FOS) is a method of precision measurement of surface topography with a scanning probe microscope in which surface features (objects) are used as reference points for microscope probe attachment. With FOS method, by passing from one surface feature to another located nearby, the relative distance between the fea...
British historian, academic, and author (born 1947) This article is about the British historian. For the British-Canadian poet, see Robert W. Service. Robert ServiceFBAService speaking at the Tallinn Literature Festival HeadRead in May 2011BornRobert John Service (1947-10-29) 29 October 1947 (age 76)United KingdomAwardsDuff Cooper Prize (2009)Academic backgroundAlma materKing's College, CambridgeAcademic workInstitutionsUniversity of OxfordMain interestsRussian history (1894–)Notable w...
Painting by Francisco de Goya Still-Life: A Butcher's CounterArtistFrancisco GoyaYear1808–1812Mediumoil paint, canvasDimensions45 cm (18 in) × 62 cm (24 in)LocationLouvre, ParisCollectionDepartment of Paintings of the Louvre Accession No.RF 1937 120 IdentifiersJoconde work ID: 000PE022858[edit on Wikidata] Still Life of a Lamb's Head and Flanks (Spanish: Bodegón con costillas, lomo y cabeza de cordero) or A Butcher's Counter (Spanish: Trozos de C...
Total mass of living organisms in a given area (all species or selected species) This article is about the ecological measure. For the renewable energy source, see biomass (energy). The total global live biomass has been estimated at 550 billion tonnes carbon,[1] most of which is found in forests.Shallow aquatic environments, such as wetlands, estuaries and coral reefs, can be as productive as forests, generating similar amounts of new biomass each year on a given area.[2] Bio...
Cet article est une ébauche concernant la gastronomie et l’Indonésie. Vous pouvez partager vos connaissances en l’améliorant (comment ?) selon les recommandations des projets correspondants. Consultez la liste des tâches à accomplir en page de discussion. Nasi gudeg javanais complet, composé de gudeg (jeune jacquier cuit dans du lait de coco), poulet frit, œuf dur et krecek (chips de peau de buffle épicée). Le gudeg est un des plats les plus fameux. La cuisine javanaise est...
FijiJulukanBula BoysAsosiasiAsosiasi Sepak Bola FijiKonfederasiOFC (Oseania)PelatihFlemming SerritslevKaptenRoy KrishnaPenampilan terbanyakRoy Krishna (41)Pencetak gol terbanyakEsala Masi (31)Stadion kandangStadion Nasional ANZKode FIFAFIJPeringkat FIFATerkini 166 2 (20 Juni 2024)[1]Tertinggi94 (Juli 1994)Terendah199 (Juli 2015)Peringkat EloTerkini 162 14 (19 Januari 2024)[2] Warna pertama Warna kedua Pertandingan internasional pertamaFiji 4–6 Selandia Baru (Suva, Fiji; 7 Ok...
Head of the Catholic Church from 1285 to 1287 Giacomo Savelli redirects here. For another person, see Giacomo Savelli (cardinal). This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages) This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.Find sources: Pope Honorius IV ...