The Sims Indonesia
September 11, 2010, 02:23:31 AM *
Welcome, Guest. Please login or register.
Did you miss your activation email?

Login with username, password and session length
News: TSI mengucapkan Selamat Idul Fitri 1431 H, Mohon Maaf Lahir & Batin

Dapatkan Segera Kalender TSI 2011
 
* ShoutBox
Sorry, you must be logged in to use the shoutbox!
  Home   Forum   Help CUSTOM Login Register  
 
Puteri Indonesia 2010


Miss Universe 2010


ROLEPLAY CONTEST
Bachelors of World

Mini News

Our Official Group

http://i35.tinypic.com/2d8176f.png

Status

Members
  • Total Members: 2909
  • Latest: howgil
Stats
  • Total Posts: 46402
  • Total Topics: 1934
  • Online Today: 14
  • Online Ever: 93
  • (February 27, 2010, 12:41:21 PM)
Users Online
  • Users: 0
  • Guests: 7
  • Total: 7
*

Pages: [1]   Go Down
« previous next »
  Add poll  |  Print  
Author Topic: UDa ada patch resmi dari EA untuk fix story progression bug  (Read 380 times)
0 Members and 1 Guest are viewing this topic.
Sweety
TSIAduhay
Rookie
*
Offline Offline

Gender: Female
Posts: 126


-:
-:



Mood:Busy
Busy
« Topic Start: June 26, 2009, 02:36:13 PM »
Complete list of changes:

    * Addresses some issues with Speed 2 and 3 moving too slowly. Some machines will have better results when using Speed 2 and 3 now.
    * Fix to story progression on/off selection toggle.
    * Fix for a possible crash with audio code.
    * Fix for babysitter routing off lots with babies.
    * Addresses some issues with Vsync and refresh rate problems.
    * Addresses some issues with DVD authentication errors and drive compatibility on startup.
    * This update deals with some issues on Mac systems that can crash the game while connecting to AFP servers.
    * Fix for a freeze that can occur when Sims attempt to clean out bad food from the fridge.

Source:
http://www.thesims3.com/game/patches/-1206416818
=======================================

tapiii, masalahnya, game kita kan bajakaaaan  :hua, sedngkan itu diupdatenya secara online.

Coba teman-teman katakan saya harus bagaimana supaya patchnya bisa dipake di game saya :shake
Logged
chucky_pakorem
TSIAduhay
Forum Resident
*
Offline Offline

Gender: Male
Awards:
TSI Contest Winner
Posts: 1578


-:
-:



Mood:Busy
Busy


WWW
« Reply #1: June 26, 2009, 06:51:06 PM »
aduh punya saya juga bajakan lagi .. O-Genit
Logged
------------------------------------------------------------------- GUNTING DISINI ------------------------------------------------------------------
sauskacang
Global Moderator
Forum Resident
*****
Offline Offline

Gender: Female
Awards:
TSI Creatormember terPINTAR 2009
Posts: 1372


-:
-:


« Reply #2: June 26, 2009, 07:53:59 PM »
Download:

US ENGLISH
Worldwide

Kalau dulu pernah install patch 1.0.632, harus install ulang game nya O-perhatian



siapa mau coba pertama? :ups
« Last Edit: June 26, 2009, 09:17:32 PM by treeag » Logged
caramelz
TSIAduhay
Rookie
*
Offline Offline

Gender: Female
Posts: 117


-:
-:



Mood:Lazy
Lazy

Chammone! Who's BAD?!
« Reply #3: June 26, 2009, 09:16:14 PM »
Eh ud ada patchna? Ayo dx siapa mau coba, trus kasih tau hasilnya ke aku juga. Kan aku belum beli ts3 nih. Kalo berhasil aku mau beli nih..
Logged
I was born to never die
to live in bliss, to never cry
opshd
TaeYeon ~
Global Moderator
Forum Contributors
*****
Offline Offline

Awards:
TSI Contest Winner
Posts: 2395


-:
-:



Mood:Okay
Okay


WWW
« Reply #4: June 26, 2009, 09:54:11 PM »
emang udah ada cracknya yah ? :wew
Logged

gilang
Doctor Wannabe
Creation Mastermind
Miracle Mite
*****
Offline Offline

Gender: Male
Posts: 65


-:
-:

Gilang? Ya Gilang laah....


WWW
« Reply #5: June 26, 2009, 11:23:06 PM »
Gw ga bisa nginstall patchnya, soalnya versi gw pake Reloaded To Razor dimana Sims3GDF.dll nya ngga valid.. Ada yg bisa bantuin uplotin yg versi retailnya??
Logged
I don't have signature. But I admit that I actually have one. The sentence I wrote before was my signature. And so the sentence left to this one.

So we can conclude that this signature fulfill the mathematical induction:
Let f(n) be a function which returns string x that is a signature with length n sentences. We want to prove that f(n) is my signature with n sentences for every n >= 1
(1) Base case: f(1) = my signature with 1 sentence
(2) Hypothesis: f(n) is my signature
(3) Inductive case: f(n+1) = f(n)f(1). It is shown that f(n + 1) is a concatenation of two string x which both of it is a signature. So according to concatenation rule of regular expression, if the a and b is concatenated and both a and b have the same property, so ab must derives the same property of a and/or b.

Another proof:
  f(n+1) = f(n)f(1) = f(n-1)f(1)f(1) = f(n-2)f(1)f(1)f(1) = f(1)...f(1)f(1) = f(1)^(n+1)
It is shown that f(n+1) is a concatenation of any singleton string which is my signature. So because all of the n+1 strings are my signatures, so the concatenation of all n+i strings must be my signature.

So it is proven using mathematical induction that this is my signature.

Panjang ya? :hahak
Sweety
TSIAduhay
Rookie
*
Offline Offline

Gender: Female
Posts: 126


-:
-:



Mood:Busy
Busy
« Reply #6: June 27, 2009, 12:52:29 AM »
bedanya versi reloaded ama razor apa yaakk?? :wew:

Punya aku versinya 1.0.615.00107 . Aku blom pernah install patch apa2 sih.. masihh murni. Tapi aku uda punya hack satu.. masalah ga ya?
Logged
gilang
Doctor Wannabe
Creation Mastermind
Miracle Mite
*****
Offline Offline

Gender: Male
Posts: 65


-:
-:

Gilang? Ya Gilang laah....


WWW
« Reply #7: June 27, 2009, 09:51:23 AM »
Itu versi Reloaded.. Versi yg katanya Pre-release. Yg versi release serinya 1.0.631 dan itu dikeluarin oleh Razor

Yg versi Reloaded kaga bisa di-patch
Logged
I don't have signature. But I admit that I actually have one. The sentence I wrote before was my signature. And so the sentence left to this one.

So we can conclude that this signature fulfill the mathematical induction:
Let f(n) be a function which returns string x that is a signature with length n sentences. We want to prove that f(n) is my signature with n sentences for every n >= 1
(1) Base case: f(1) = my signature with 1 sentence
(2) Hypothesis: f(n) is my signature
(3) Inductive case: f(n+1) = f(n)f(1). It is shown that f(n + 1) is a concatenation of two string x which both of it is a signature. So according to concatenation rule of regular expression, if the a and b is concatenated and both a and b have the same property, so ab must derives the same property of a and/or b.

Another proof:
  f(n+1) = f(n)f(1) = f(n-1)f(1)f(1) = f(n-2)f(1)f(1)f(1) = f(1)...f(1)f(1) = f(1)^(n+1)
It is shown that f(n+1) is a concatenation of any singleton string which is my signature. So because all of the n+1 strings are my signatures, so the concatenation of all n+i strings must be my signature.

So it is proven using mathematical induction that this is my signature.

Panjang ya? :hahak
Sweety
TSIAduhay
Rookie
*
Offline Offline

Gender: Female
Posts: 126


-:
-:



Mood:Busy
Busy
« Reply #8: June 27, 2009, 04:12:27 PM »
jadi aku nga bisa pk patch yang dikasih tree??
Logged
gilang
Doctor Wannabe
Creation Mastermind
Miracle Mite
*****
Offline Offline

Gender: Male
Posts: 65


-:
-:

Gilang? Ya Gilang laah....


WWW
« Reply #9: June 27, 2009, 08:28:56 PM »
Sayang sekali tidak. Elu harus patch dari Reloaded to Razor dulu. Di IDWS ada. Tapi gedenya sampe 700 MB
Logged
I don't have signature. But I admit that I actually have one. The sentence I wrote before was my signature. And so the sentence left to this one.

So we can conclude that this signature fulfill the mathematical induction:
Let f(n) be a function which returns string x that is a signature with length n sentences. We want to prove that f(n) is my signature with n sentences for every n >= 1
(1) Base case: f(1) = my signature with 1 sentence
(2) Hypothesis: f(n) is my signature
(3) Inductive case: f(n+1) = f(n)f(1). It is shown that f(n + 1) is a concatenation of two string x which both of it is a signature. So according to concatenation rule of regular expression, if the a and b is concatenated and both a and b have the same property, so ab must derives the same property of a and/or b.

Another proof:
  f(n+1) = f(n)f(1) = f(n-1)f(1)f(1) = f(n-2)f(1)f(1)f(1) = f(1)...f(1)f(1) = f(1)^(n+1)
It is shown that f(n+1) is a concatenation of any singleton string which is my signature. So because all of the n+1 strings are my signatures, so the concatenation of all n+i strings must be my signature.

So it is proven using mathematical induction that this is my signature.

Panjang ya? :hahak
Pages: [1]   Go Up
  Add poll  |  Print  
« previous next »
 
Jump to:  

This site is not endorsed by or affiliated with Electronic Arts, or its licensors.
Trademarks are the property of their respective owners. Game content and materials
copyright Electronic Arts Inc. and its licensors. All Rights Reserved.

TinyPortal v1.0.5 beta 1© Bloc

Powered by MySQL Powered by PHP Powered by SMF 1.1.11 | SMF © 2006-2009, Simple Machines LLC Valid XHTML 1.0! Valid CSS!
Page created in 0.178 seconds with 35 queries.